Creation of ballot sequences in a periodic cellular automaton

Motivated by an attempt to develop a method for solving initial value problems in a class of one dimensional periodic cellular automata (CA) associated with crystal bases and soliton equations, we consider a generalization of a simple proposition in elementary mathematics. The original proposition says that any sequence of letters 1 and 2, having no less 1’s than 2’s, can be changed into a ballot sequence via cyclic shifts only. We generalize it to treat sequences of cells of common capacity s > 1, each of them containing consecutive 2’s (left) and 1’s (right), and show that these sequences can be changed into a ballot sequence via two manipulations, cyclic and “quasi-cyclic” shifts. The latter is a new CA rule and we find that various kink-like structures are traveling along the system like particles under the time evolution of this rule.

💡 Research Summary

The paper addresses a natural extension of the classic ballot‑sequence theorem, which states that any binary word composed of the symbols 1 and 2, with at least as many 1’s as 2’s in every prefix, can be turned into a ballot sequence by cyclic shifts alone. The authors generalize this result to a setting where each “cell’’ of a one‑dimensional periodic cellular automaton (CA) has capacity s > 1 and contains a block of consecutive 2’s on the left and a block of consecutive 1’s on the right. In this multi‑capacity model the simple cyclic shift is no longer sufficient, so they introduce a second operation called a “quasi‑cyclic shift.”

A quasi‑cyclic shift is a new CA rule that simultaneously examines each pair of neighboring cells. If cell i contains more 2’s than the adjacent cell i + 1 contains 1’s, the excess 2’s are transferred to cell i + 1; conversely, if cell i has an excess of 1’s relative to the 2’s in cell i − 1, those 1’s move leftward. This local redistribution is performed in parallel across the whole lattice, creating localized discontinuities that the authors refer to as “kinks.” The kinks behave like particles: they travel at a constant speed, preserve their shape after collisions, and can be interpreted as digital analogues of solitons in integrable systems.

The authors prove that any initial configuration can be transformed into a ballot sequence by a finite sequence of ordinary cyclic shifts followed by a finite number of quasi‑cyclic shifts. The proof relies on an induction on the total number of symbols and on an invariant that the global count of 1’s and 2’s is preserved. Moreover, they show that larger cell capacities reduce the number of required quasi‑cyclic steps because each step can move a larger block of symbols.

Through extensive simulations they illustrate the dynamics of kinks and anti‑kinks, demonstrating that the quasi‑cyclic rule generates particle‑like excitations that propagate without dispersion, reminiscent of the behavior of solitons in crystal‑basis models and discrete soliton equations. The paper also discusses connections to conserved‑quantity cellular automata, highlighting that the quasi‑cyclic rule breaks the usual conservation laws while still preserving the total symbol count, thereby offering a novel mechanism for information transport in periodic CA.

Finally, the work suggests that this two‑step manipulation—cyclic plus quasi‑cyclic shifts—provides a constructive algorithm for solving initial‑value problems in a broad class of periodic cellular automata linked to crystal bases and integrable systems. It opens avenues for designing CA‑based soliton simulators and for exploring particle‑like dynamics in discrete, periodic media.