On the hierarchy of conservation laws in a cellular automaton
- 133 Downloads
Conservation laws in cellular automata (CA) are studied as an abstraction of the conservation laws observed in nature. In addition to the usual real-valued conservation laws we also consider more general group-valued and semigroup-valued conservation laws. The (algebraic) conservation laws in a CA form a hierarchy, based on the range of the interactions they take into account. The conservation laws with smaller interaction ranges are the homomorphic images of those with larger interaction ranges, and for each specific range there is a most general law that incorporates all those with that range. For one-dimensional CA, such a most general conservation law has—even in the semigroup-valued case—an effectively constructible finite presentation, while for higher-dimensional CA such effective construction exists only in the group-valued case. It is even undecidable whether a given two-dimensional CA conserves a given semigroup-valued energy assignment. Although the local properties of this hierarchy are tractable in the one-dimensional case, its global properties turn out to be undecidable. In particular, we prove that it is undecidable whether this hierarchy is trivial or unbounded. We point out some interconnections between the structure of this hierarchy and the dynamical properties of the CA. In particular, we show that positively expansive CA do not have non-trivial real-valued conservation laws.
KeywordsCellular automata Conservation laws Energy Reversibility Undecidability Dynamical systems Chaos
This work has been supported by the French ANR Blanc Project “EMC” and the Academy of Finland grant 131558.
- Formenti E, Kari J, Taati S (2008) The most general conservation law for a cellular automaton. In: Hirsch EA, Razborov AA, Semenov AL, Slissenko A (eds) CSR vol 5010 of Lecture notes in computer science. Springer, New York, pp 194–203Google Scholar
- Fukś H (2000) A class of cellular automata equivalent to deterministic particle systems. In: Feng S, Lawniczak AT, Varadhan SRS (eds) Hydrodynamic limits and related topics, vol 27 of Fields institute communications. American Mathematical Society, Providence, pp 57–69Google Scholar
- Grillet PA (1995) Semigroups: an introduction to the structure theory. Dekker, New YorkGoogle Scholar
- Kari J (2000) Linear cellular automata with multiple state variables. In: Reichel H, Tison S (eds) STACS vol 1770 of Lecture notes in computer science. Springer, New York, pp 110–121Google Scholar
- Kůrka P (2003) Topological and symbolic dynamics, vol 11 of Cours Spécialisés, Société Mathématique de FranceGoogle Scholar
- Moore EF (1962) Machine models of self-reproduction. In: Proceedings of symposia in applied mathematics. AMS, Providence, pp 17–33Google Scholar
- Myhill J (1963) The converse of Moore’s garden-of-Eden theorem. Proc Am Math Soc 14:685–686Google Scholar
- Nasu M (1995) Textile systems for endomorphisms and automorphisms of the shift. Mem Am Math Soc 114, no. 546, pp viii + 215Google Scholar