Finite entropy for multidimensional cellular automata

dc.creatorMeyerovitch, Tom
dc.date2007-03-06
dc.date2007-05-30
dc.date.accessioned2026-07-07T08:08:51Z
dc.date.available2026-07-07T08:08:51Z
dc.descriptionLet $X=S^G$ where $G$ is a countable group and $S$ is a finite set. A cellular automaton (CA) is an endomorphism $T : X \to X$ (continuous, commuting with the action of $G$). Shereshevsky (1993) proved that for $G=Z^d$ with $d>1$ no CA can be forward expansive, raising the following conjecture: For $G=Z^d$, $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).
dc.description17 pages, 11 figures; Added references, proposition 3.5 and correction of minor mistake in section 2
dc.identifierhttps://arxiv.org/abs/math/0703167
dc.identifierhttp://arxiv.org/abs/math/0703167
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/131400
dc.subjectDynamical Systems
dc.subject37B15; 37B40; 37B50
dc.titleFinite entropy for multidimensional cellular automata
dc.typetext

Files

Collections