Cellular automata on group sets and the uniform Curtis–Hedlund–Lyndon theorem

  • Simon Wacker


We introduce cellular automata whose cell spaces are left-homogeneous spaces, show that their global transition functions are closed under composition, prove a uniform as well as a topological variant of the Curtis–Hedlund–Lyndon theorem, and deduce that such an automaton is invertible if and only if its global transition function is bijective. Examples of left-homogeneous spaces are spheres, Euclidean spaces, as well as hyperbolic spaces acted on by isometries; uniform tilings acted on by symmetries; vertex-transitive graphs, in particular, Cayley graphs, acted on by automorphisms; groups acting on themselves by multiplication; and integer lattices acted on by translations.


Cellular automata Group actions Homogeneous spaces Properness Curtis–Hedlund–Lyndon theorem Invertibility 


  1. Ceccherini-Silberstein T, Coornaert M (2008) A generalization of the Curtis–Hedlund theorem. Theor Comput Sci 400(1–3):225–229MathSciNetCrossRefMATHGoogle Scholar
  2. Ceccherini-Silberstein T, Coornaert M (2010) Cellular automata and groups. Springer monographs in mathematics. Springer, BerlinCrossRefMATHGoogle Scholar
  3. Gonçalves D, Sobottka M, Starling C (2016) Sliding block codes between shift spaces over infinite alphabets. Math Nachr 289(17–18):2178–2191MathSciNetCrossRefMATHGoogle Scholar
  4. Gorbatsevich VV, Onishchik AL, Kozlowski T, Vinberg EB (2013) Lie groups and Lie algebras I: Foundations of Lie theory Lie transformation groups. Encyclopaedia of mathematical sciences. Springer, BerlinGoogle Scholar
  5. Hedlund GA (1969) Endomorphisms and automorphisms of the shift dynamical system. Math Syst Theory 3(4):320–375MathSciNetCrossRefMATHGoogle Scholar
  6. Kassel F (2012) Deformation of proper actions on reductive homogeneous spaces. Math Ann 353(2):599–632MathSciNetCrossRefMATHGoogle Scholar
  7. Lee JM (2013) Introduction to smooth manifolds. Graduate texts in mathematics. Springer, BerlinGoogle Scholar
  8. Moriceau S (2011) Cellular automata on a \(G\)-set. J Cell Autom 6(6):461–486MathSciNetGoogle Scholar
  9. Ott W, Tomforde M, Willis PN (2014) One-sided shift spaces over infinite alphabets. N Y J Math Monogr 5:54ppGoogle Scholar
  10. Sobottka M, Gonçalves D (2017) A note on the definition of sliding block codes and the Curtis–Hedlund–Lyndon theorem. J Cell Autom 12(3–4):209–215MathSciNetGoogle Scholar
  11. Wacker S (2016) The Garden of Eden theorem for cellular automata on group sets. In: Cellular automata, pp 66–78. arXiv:1603.07272 [math.GR]
  12. Wacker S (2017) Right amenable left group sets and the Tarski–Følner theorem. In: International journal of group theory. arXiv:1603.06460 [math.GR] (to be published)
  13. Willard S (2012) General topology. Dover books on mathematics. Dover, New YorkGoogle Scholar

Copyright information

© Springer Science+Business Media B.V. 2017

Authors and Affiliations

  1. 1.Karlsruhe Institute of TechnologyKarlsruheGermany

Personalised recommendations