arXiv:1603.07271 [math.GR]AbstractReferencesReviewsResources
Cellular Automata on Group Sets and the Uniform Curtis-Hedlund-Lyndon Theorem
Published 2016-03-21Version 1
We introduce cellular automata whose cell spaces are left homogeneous spaces and prove a uniform as well as a topological variant of the Curtis-Hedlund-Lyndon theorem. Examples of left homogeneous spaces are spheres, Euclidean spaces, as well as hyperbolic spaces acted on by isometries; vertex-transitive graphs, in particular, Cayley graphs, acted on by automorphisms; groups acting on themselves by multiplication; and integer lattices acted on by translations.
Related articles: Most relevant | Search more
arXiv:1603.07272 [math.GR] (Published 2016-03-21)
The Garden of Eden Theorem for Cellular Automata on Group Sets
arXiv:1808.08697 [math.GR] (Published 2018-08-27)
Universal groups of cellular automata
arXiv:1901.02808 [math.GR] (Published 2019-01-09)
Bounding the minimal number of generators of groups of cellular automata