Finite entropy for multidimensional cellular automata
Abstract
Let X=SG where G is a countable group and S is a finite set. A cellular automaton (CA) is an endomorphism T : X X (continuous, commuting with the action of G). Shereshevsky (1993) proved that for G=Zd with d>1 no CA can be forward expansive, raising the following conjecture: For G=Zd, d>1 the topological entropy of any CA is either zero or infinite. Morris and Ward (1998), proved this for linear CA's, leaving the original conjecture open. We show that this conjecture is false, proving that for any d there exist a d-dimensional CA with finite, nonzero topological entropy. We also discuss a measure-theoretic counterpart of this question for measure-preserving CA's. Our main tool is a construction of a CA by Kari (1994).
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.