Generic period conjecture for crystal cellular automata
Generic period conjecture for crystal cellular automata
Let be a state with soliton content , and let for every . Denote by the least common multiple defined earlier in the source. Generic period conjecture. The dynamical period of under , namely the minimum positive integer such that , equals generically and is a divisor of otherwise. This gives the expected generic orbit length of a state in terms of the Bethe-ansatz period formula; exceptional states may have shorter periods. The supplied text gives no resolution status.
Sources & referencesView supporting material
Primary source
Atsuo Kuniba and Akira Takenouchi, “Periodic cellular automata and Bethe ansatz”, arXiv:math-ph/0511013 (2006).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.