Amenability of groups is characterized by Myhill's Theorem
arXiv:1605.09133
Abstract
We prove a converse to Myhill's "Garden-of-Eden" theorem and obtain in this manner a characterization of amenability in terms of cellular automata: "A group is amenable if and only if every cellular automaton with carrier that has gardens of Eden also has mutually erasable patterns." This answers a question by Schupp, and solves a conjecture by Ceccherini-Silberstein, Machì and Scarabotti. An appendix by Dawid Kielak proves that group rings without zero divisors are Ore domains precisely when the group is amenable, answering a conjecture attributed to Guba.
2nd version including results on Ore domains
Cited by in corpus (11)
- Residually finite rationally solvable groups and virtual fibring
- Examples in the entropy theory of countable group actions
- On linear shifts of finite type and their endomorphisms
- On sofic groups, Kaplansky's conjectures, and endomorphisms of pro-algebraic groups
- Garden of Eden and Specification
- Improved algebraic fibrings
- A Garden of Eden theorem for principal algebraic actions
- The Garden of Eden theorem: old and new
- Pre-Expansivity in Cellular Automata
- Dynamical correspondences of -Betti numbers
- Entropy on modules over the group ring of a sofic group