Abstract
We show that on the four-symbol full shift, there is a finitely generated subgroup of the automorphism group whose action is (set-theoretically) transitive of all orders on the points of finite support, up to the necessary caveats due to shift-commutation. As a corollary, we obtain that there is a finite set of automorphisms whose centralizer is
$\mathbb{Z}$
(the shift group), giving a finitary version of Ryan’s theorem (on the four-symbol full shift), suggesting an automorphism group invariant for mixing subshifts of finite type (SFTs). We show that any such set of automorphisms must generate an infinite group, and also show that there is also a group with this transitivity property that is a subgroup of the commutator subgroup and whose elements can be written as compositions of involutions. We ask many related questions and prove some easy transitivity results for the group of reversible Turing machines, topological full groups and Thompson’s
$V$
.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,General Mathematics
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Symbolic dynamics and the stable algebra of matrices;Groups and Graphs, Designs and Dynamics;2024-06-30
2. Universal groups of cellular automata;Colloquium Mathematicum;2022
3. Glider automata on all transitive sofic shifts;Ergodic Theory and Dynamical Systems;2021-09-30
4. Generating infinite monoids of cellular automata;Journal of Algebra and Its Applications;2021-07-24
5. No Tits alternative for cellular automata;Groups, Geometry, and Dynamics;2019-09-30