Related papers: Some remarks on A_1^{(1)} soliton cellular automat…
A soliton cellular automaton associated with crystals of symmetric tensor representations of the quantum affine algebra U'_q(A^{(1)}_M) is introduced. It is a crystal theoretic formulation of the generalized box-ball system in which…
Number-conserving (or {\em conservative}) cellular automata have been used in several contexts, in particular traffic models, where it is natural to think about them as systems of interacting particles. In this article we consider several…
If X is a discrete abelian group and B a finite set, then a cellular automaton (CA) is a continuous map F:B^X-->B^X that commutes with all X-shifts. If g is a real-valued function on B, then, for any b in B^X, we define G(b) to be the sum…
In this paper, we consider the soliton cellular automaton introduced in [Takahashi 1990] with a random initial configuration. We give multiple constructions of a Young diagram describing various statistics of the system in terms of familiar…
We rigorously prove a form of disorder-resistance for a class of one-dimensional cellular automaton rules, including some that arise as boundary dynamics of two-dimensional solidification rules. Specifically, when started from a random…
A simple relation of the order of $n$ abstract objects generates an $n-2$ dimensional basis of three dimensional vectors. A cellular automaton-like model of evolution of this system is postulated. During this evolution, some quantities…
Factorized dynamics in soliton cellular automata with quantum group symmetry is identified with a motion of particles and anti-particles exhibiting pair creation and annihilation. An embedding scheme is presented showing that the…
For soliton cellular automata, we give a uniform description and proofs of the solitons, the scattering rule of two solitons, and the phase shift using rigged configurations in a number of special cases. In particular, we prove these…
This paper shows how to determine all the unidimensional two-state cellular automaton rules of a given number of inputs which conserve the number of active sites. These rules have to satisfy a necessary and sufficient condition. If the…
We present an elementary algorithm for the dynamics of recently introduced soliton cellular automata associated with quantum affine algebra U_q(g_n) at q=0. For g_n = A^{(1)}_n, the rule reproduces the ball-moving algorithm in…
Evidence and results suggesting that a Noether--like theorem for conservation laws in 1D RCA can be obtained. Unlike Noether's theorem, the connection here is to the maximal congruences rather than the automorphisms of the local dynamics.…
A necessary and sufficient condition for a one-dimensional q-state n-input cellular automaton rule to be number-conserving is established. Two different forms of simpler and more visual representations of these rules are given, and their…
Number-conserving cellular automata are discrete dynamical systems that simulate interacting particles like e.g. grains of sand. In an earlier paper, I had already derived a uniform construction for all transition rules of one-dimensional…
Cellular automata can show well known features of quantum mechanics, such as a linear rule according to which they evolve and which resembles a discretized version of the Schroedinger equation. This includes corresponding conservation laws.…
We review and generalize the recent progress in a soliton cellular automaton known as the periodic box-ball system. It has the extended affine Weyl group symmetry and admits the commuting transfer matrix method and the Bethe ansatz at q=0.…
A number-conserving cellular automaton is a simplified model for a system of interacting particles. This paper contains two related constructions by which one can find all one-dimensional number-conserving cellular automata with one kind of…
Cellular automata are a set of computational models in discrete space that have a discrete time evolution defined by neighbourhood rules. They are used to simulate many complex systems in physics and science in general. In this work,…
Generalizing the motion representation we introduced for number-conserving rules, we give a systematic way to construct a generalized motion representation valid for non-conservative rules using the expression of the current, which appears…
A soliton cellular automaton on a one dimensional semi-infinite lattice with a reflecting end is presented. It extends a box-ball system on an infinite lattice associated with the crystal base of U_q(sl_n). A commuting family of time…
We show that there exists a one-to-one correspondence between the set of number-conserving cellular automata (CA) with $q$ inputs and the set of balanced sequences with $q$ terms. This allows to enumerate number-conserving CA. We also show…