Amenability of groups is characterized by Myhill's Theorem
Formal Languages and Automata Theory
2016-06-09 v2 Group Theory
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\`i 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.
Keywords
Cite
@article{arxiv.1605.09133,
title = {Amenability of groups is characterized by Myhill's Theorem},
author = {Laurent Bartholdi and Dawid Kielak},
journal= {arXiv preprint arXiv:1605.09133},
year = {2016}
}
Comments
2nd version including results on Ore domains