arXiv:2012.10186 [math.GR]AbstractReferencesReviewsResources
Graph and wreath products of cellular automata
Published 2020-12-18Version 1
We prove that the set of subgroups of the automorphism group of a two-sided full shift is closed under graph products. We introduce the notion of an Aithful group action, and show that when A is a finite abelian group and G is a group of cellular automata whose action is Aithful, the wreath product A \wr G embeds in the automorphism group of a full shift. We show that all free abelian groups and free groups admit Aithful cellular automata actions. In the one-sided case, we prove variants of these result with reasonable alphabet blow-ups.
Comments: 20 pages
Related articles: Most relevant | Search more
arXiv:1607.02464 [math.GR] (Published 2016-07-08)
A Classification Theorem for Varieties Generated by Wreath Products of Groups
arXiv:1012.4177 [math.GR] (Published 2010-12-19)
A Kronecker-Weyl theorem for subsets of abelian groups
arXiv:2308.08059 [math.GR] (Published 2023-08-15)
Topological Properties of Almost Abelian Groups