Trees are nilrigid
Abstract
We study cellular automata on the unoriented k-regular tree Tk, i.e. continuous maps acting on colorings Tk which commute with all automorphisms of the tree. We prove that every CA that is asymptotically nilpotent, meaning every configuration converges to the same constant configuration, is nilpotent, meaning each configuration is mapped to that configuration after finite time. We call group actions nilrigid when their cellular automata have this property, following Salo and T\"orm\"a. In this terminology, the full action of the automorphism group of the k-regular tree is nilrigid. We do not know whether there is a nilrigid automorphism group action on Tk that is simply transitive on vertices.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.