Abstract
Mutations on Brauer configurations are introduced and associated with some suitable automata to solve generalizations of the Chicken McNugget problem. Additionally, based on marked order polytopes, the new Diophantine equations called Gelfand–Tsetlin equations are also solved. The approach allows algebraic descriptions of some properties of the AES key schedule via some Brauer configuration algebras and suitable non-deterministic finite automata (NFA).
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference27 articles.
1. Factoring in the Chicken McNugget Monoid
2. The many aspects of counting lattice points in polytopes
3. On the partition of numbers;Sylvester;Quart. J. Pure Appl. Math.,1857
4. The Diophantine Frobenius Problem;Ramírez-Alfonsín,2005
5. Introductio in Analysin Infinitorium;Euler,1748
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献