Hostname: page-component-848d4c4894-wzw2p Total loading time: 0 Render date: 2024-05-27T22:40:58.441Z Has data issue: false hasContentIssue false
  • English
  • Français

Transitive action on finite points of a full shift and a finitary Ryan’s theorem

Published online by Cambridge University Press:  10 November 2017

VILLE SALO Open the ORCID record for VILLE SALO [Opens in a new window]
VILLE SALO*
Affiliation:
Department of Mathematics and Statistics, University of Turku, Turku, Finland email vosalo@utu.fi
Get access Rights & Permissions [Opens in a new window]

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$.

Type
Original Article
Information
Ergodic Theory and Dynamical Systems , Volume 39 , Issue 6 , June 2019 , pp. 1637 - 1667
Copyright
© Cambridge University Press, 2017 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Barbieri, S., Kari, J. and Salo, V.. The Group of Reversible Turing Machines. Springer International Publishing, Cham, 2016, pp. 49–62.Google Scholar
Boykett, T.. Closed systems of invertible maps. Preprint, 2015, https://arxiv.org/abs/1512.06813.Google Scholar
Boykett, T., Kari, J. and Salo, V.. Strongly Universal Reversible Gate Sets. Springer International Publishing, Cham, 2016, pp. 239–254.Google Scholar
Boyle, M.. Some sofic shifts cannot commute with nonwandering shifts of finite type. Illinois J. Math. 48(4) (2004), 1267–1277.Google Scholar
Boyle, M.. Open problems in symbolic dynamics. Geometric and Probabilistic Structures in Dynamics (Contemporary Mathematic, 469) . American Mathematical Society, Providence, RI, 2008, pp. 69–118.Google Scholar
Boyle, M. and Chuysurichay, S.. The mapping class group of a shift of finite type. Preprint, 2017, https://arxiv.org/abs/1704.03916.Google Scholar
Boyle, M. and Fiebig, U.-R.. The action of inert finite-order automorphisms on finite subsystems of the shift. Ergod. Th. & Dynam. Sys. 11(03) (1991), 413–425.Google Scholar
Boyle, M., Lind, D. and Rudolph, D.. The automorphism group of a shift of finite type. Trans. Amer. Math. Soc. 306(1) (1988), 71–114.Google Scholar
Boyle, M., Meier Carlsen, T. and Eilers, S.. Flow equivalence of G-SFTs. Preprint, 2015, https://arxiv.org/abs/1512.05238.Google Scholar
Boyle, M. and Tuncel, S.. Infinite-to-one codes and Markov measures. Trans. Amer. Math. Soc. 285(2) (1984), 657–684.Google Scholar
Cannon, J. W., Floyd, W. J. and Parry, W. R.. Introductory notes on Richard Thompson’s groups. Enseign. Math. 42 (1996), 215–256.Google Scholar
Ceccherini-Silberstein, T. and Coornaert, M.. Cellular Automata and Groups (Springer Monographs in Mathematics) . Springer, Berlin, 2010.Google Scholar
Charney, R.. An introduction to right-angled artin groups. Geom. Dedicata 125(1) (2007), 141–158.Google Scholar
Coven, E. and Yassawi, R.. Endomorphisms and automorphisms of minimal symbolic systems with sublinear complexity. Preprint, 2014, https://arxiv.org/abs/1412.0080.Google Scholar
Cyr, V. and Kra, B.. The automorphism group of a shift of subquadratic growth. Preprint, 2014, https://arxiv.org/abs/1403.0238.Google Scholar
Dixon, J. D. and Mortimer, B.. Permutation Groups. Vol. 163. Springer, New York, 1996.Google Scholar
Donoso, S., Durand, F., Maass, A. and Petite, S.. On automorphism groups of low complexity subshifts. Ergod. Th. & Dynam. Sys. 36(01) (2016), 64–95.Google Scholar
Frisch, J., Schlank, T. and Tamuz, O.. Normal amenable subgroups of the automorphism group of the full shift. Ergod. Th. & Dynam. Sys. doi:10.1017/etds.2017.72, Published online 7 September 2017, pp. 1–9.Google Scholar
Hedlund, G. A.. Endomorphisms and automorphisms of the shift dynamical system. Math. Syst. Theory 3 (1969), 320–375.Google Scholar
Host, B. and Parreau, F.. Homomorphismes entre systèmes dynamiques définis par substitutions. Ergod. Th. & Dynam. Sys. 9(8) (1989), 469–477.Google Scholar
Kari, J.. Representation of reversible cellular automata with block permutations. Theory Comput. Syst. 29 (1996), 47–61.Google Scholar
Kari, J.. Theory of cellular automata: a survey. Theoret. Comput. Sci. 334(1–3) (2005), 3–33.Google Scholar
Kari, J.. Universal pattern generation by cellular automata. Theoret. Comput. Sci. 429 (2012), 180–184.Google Scholar
Kari, J. and Ollinger, N.. Periodicity and immortality in reversible computing. Proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science, MFCS ’08. Springer, Berlin, 2008, pp. 419–430.Google Scholar
Kim, K. H. and Roush, F. W.. On the automorphism groups of subshifts. Pure Math. Appl. 1(4) (1990), 203–230.Google Scholar
Kim, K. H., Roush, F. W. and Wagoner, J. B.. Characterization of inert actions on periodic points. Part I. Forum Math. 12 (2000), 565–602.Google Scholar
Kim, K. H., Roush, F. W. and Wagoner, J. B.. Characterization of inert actions on periodic points. Part II. Forum Math. 12 (2000), 671–712.Google Scholar
Lafont, Y.. Towards an algebraic theory of boolean circuits. J. Pure Appl. Algebra 184 (2003).Google Scholar
Lind, D. A.. The entropies of topological Markov shifts and a related class of algebraic integers. Ergod. Th. & Dynam. Sys. 4(6) (1984), 283–300.Google Scholar
Lind, D. and Marcus, B.. An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge, 1995.Google Scholar
Lind, D. and Schmidt, K.. Homoclinic points of algebraic ℤ d -actions. J. Amer. Math. Soc. 12(4) (1999), 953–980.Google Scholar
Lukkarila, V.. Sensitivity and topological mixing are undecidable for reversible one-dimensional cellular automata. J. Cell. Autom. 5(3) (2010), 241–272.Google Scholar
Matui, H.. Some remarks on topological full groups of cantor minimal systems. Internat. J. Math. 17(02) (2006), 231–251.Google Scholar
McGoff, K.. Random subshifts of finite type. Ann. Probab. 40(2) (2012), 648–694.Google Scholar
Nasu, M.. Textile systems for endomorphisms and automorphisms of the shift. Mem. Amer. Math. Soc. 114(546) (1995), viii + 215.Google Scholar
Nasu, M.. Textile systems and one-sided resolving automorphisms and endomorphisms of the shift. Ergod. Th. & Dynam. Sys. 28 (2008), 167–209.Google Scholar
Olli, J.. Endomorphisms of sturmian systems and the discrete chair substitution tiling system. Dyn. Syst. 33(9) (2013), 4173–4186.Google Scholar
Patrick Ryan, J.. The shift and commutativity. Math. Syst. Theory 6(1–2) (1972), 82–85.Google Scholar
Salo, V.. Subshifts with simple cellular automata. PhD Thesis, University of Turku, 2014.Google Scholar
Salo, V.. Toeplitz subshift whose automorphism group is not finitely generated. Colloquium Math. 146 (2017), 53–76.Google Scholar
Salo, V.. A note on subgroups of automorphism groups of full shifts. Ergod. Th. & Dynam. Sys. doi:10.1017/etds.2016.95, Published online 8 November 2016, pp. 1–13.Google Scholar
Salo, V.. Transitive action on finite points of a full shift and a finitary Ryan’s theorem. Preprint, 2016, https://arxiv.org/abs/1610.05487v1.Google Scholar
Salo, V. and Törmä, I.. Color blind cellular automata. J. Cell. Autom. 9(5–6) (2014), 477–509.Google Scholar
Selinger, P.. Reversible $k$ -valued logic circuits are finitely generated for odd  $k$ . Preprint, 2016, https://arxiv.org/abs/1604.01646.Google Scholar