Skip to main content Accessibility help
×
×
Home

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

  • VILLE SALO (a1)

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

Copyright

References

Hide All
[1] Barbieri, S., Kari, J. and Salo, V.. The Group of Reversible Turing Machines. Springer International Publishing, Cham, 2016, pp. 4962.
[2] Boykett, T.. Closed systems of invertible maps. Preprint, 2015, https://arxiv.org/abs/1512.06813.
[3] Boykett, T., Kari, J. and Salo, V.. Strongly Universal Reversible Gate Sets. Springer International Publishing, Cham, 2016, pp. 239254.
[4] Boyle, M.. Some sofic shifts cannot commute with nonwandering shifts of finite type. Illinois J. Math. 48(4) (2004), 12671277.
[5] Boyle, M.. Open problems in symbolic dynamics. Geometric and Probabilistic Structures in Dynamics (Contemporary Mathematic, 469) . American Mathematical Society, Providence, RI, 2008, pp. 69118.
[6] Boyle, M. and Chuysurichay, S.. The mapping class group of a shift of finite type. Preprint, 2017, https://arxiv.org/abs/1704.03916.
[7] 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), 413425.
[8] Boyle, M., Lind, D. and Rudolph, D.. The automorphism group of a shift of finite type. Trans. Amer. Math. Soc. 306(1) (1988), 71114.
[9] Boyle, M., Meier Carlsen, T. and Eilers, S.. Flow equivalence of G-SFTs. Preprint, 2015, https://arxiv.org/abs/1512.05238.
[10] Boyle, M. and Tuncel, S.. Infinite-to-one codes and Markov measures. Trans. Amer. Math. Soc. 285(2) (1984), 657684.
[11] Cannon, J. W., Floyd, W. J. and Parry, W. R.. Introductory notes on Richard Thompson’s groups. Enseign. Math. 42 (1996), 215256.
[12] Ceccherini-Silberstein, T. and Coornaert, M.. Cellular Automata and Groups (Springer Monographs in Mathematics) . Springer, Berlin, 2010.
[13] Charney, R.. An introduction to right-angled artin groups. Geom. Dedicata 125(1) (2007), 141158.
[14] Coven, E. and Yassawi, R.. Endomorphisms and automorphisms of minimal symbolic systems with sublinear complexity. Preprint, 2014, https://arxiv.org/abs/1412.0080.
[15] Cyr, V. and Kra, B.. The automorphism group of a shift of subquadratic growth. Preprint, 2014, https://arxiv.org/abs/1403.0238.
[16] Dixon, J. D. and Mortimer, B.. Permutation Groups. Vol. 163. Springer, New York, 1996.
[17] Donoso, S., Durand, F., Maass, A. and Petite, S.. On automorphism groups of low complexity subshifts. Ergod. Th. & Dynam. Sys. 36(01) (2016), 6495.
[18] 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.
[19] Hedlund, G. A.. Endomorphisms and automorphisms of the shift dynamical system. Math. Syst. Theory 3 (1969), 320375.
[20] Host, B. and Parreau, F.. Homomorphismes entre systèmes dynamiques définis par substitutions. Ergod. Th. & Dynam. Sys. 9(8) (1989), 469477.
[21] Kari, J.. Representation of reversible cellular automata with block permutations. Theory Comput. Syst. 29 (1996), 4761.
[22] Kari, J.. Theory of cellular automata: a survey. Theoret. Comput. Sci. 334(1–3) (2005), 333.
[23] Kari, J.. Universal pattern generation by cellular automata. Theoret. Comput. Sci. 429 (2012), 180184.
[24] 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. 419430.
[25] Kim, K. H. and Roush, F. W.. On the automorphism groups of subshifts. Pure Math. Appl. 1(4) (1990), 203230.
[26] Kim, K. H., Roush, F. W. and Wagoner, J. B.. Characterization of inert actions on periodic points. Part I. Forum Math. 12 (2000), 565602.
[27] Kim, K. H., Roush, F. W. and Wagoner, J. B.. Characterization of inert actions on periodic points. Part II. Forum Math. 12 (2000), 671712.
[28] Lafont, Y.. Towards an algebraic theory of boolean circuits. J. Pure Appl. Algebra 184 (2003).
[29] Lind, D. A.. The entropies of topological Markov shifts and a related class of algebraic integers. Ergod. Th. & Dynam. Sys. 4(6) (1984), 283300.
[30] Lind, D. and Marcus, B.. An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge, 1995.
[31] Lind, D. and Schmidt, K.. Homoclinic points of algebraic ℤ d -actions. J. Amer. Math. Soc. 12(4) (1999), 953980.
[32] Lukkarila, V.. Sensitivity and topological mixing are undecidable for reversible one-dimensional cellular automata. J. Cell. Autom. 5(3) (2010), 241272.
[33] Matui, H.. Some remarks on topological full groups of cantor minimal systems. Internat. J. Math. 17(02) (2006), 231251.
[34] McGoff, K.. Random subshifts of finite type. Ann. Probab. 40(2) (2012), 648694.
[35] Nasu, M.. Textile systems for endomorphisms and automorphisms of the shift. Mem. Amer. Math. Soc. 114(546) (1995), viii + 215.
[36] Nasu, M.. Textile systems and one-sided resolving automorphisms and endomorphisms of the shift. Ergod. Th. & Dynam. Sys. 28 (2008), 167209.
[37] Olli, J.. Endomorphisms of sturmian systems and the discrete chair substitution tiling system. Dyn. Syst. 33(9) (2013), 41734186.
[38] Patrick Ryan, J.. The shift and commutativity. Math. Syst. Theory 6(1–2) (1972), 8285.
[39] Salo, V.. Subshifts with simple cellular automata. PhD Thesis, University of Turku, 2014.
[40] Salo, V.. Toeplitz subshift whose automorphism group is not finitely generated. Colloquium Math. 146 (2017), 5376.
[41] 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.
[42] 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.
[43] Salo, V. and Törmä, I.. Color blind cellular automata. J. Cell. Autom. 9(5–6) (2014), 477509.
[44] Selinger, P.. Reversible $k$ -valued logic circuits are finitely generated for odd  $k$ . Preprint, 2016, https://arxiv.org/abs/1604.01646.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Ergodic Theory and Dynamical Systems
  • ISSN: 0143-3857
  • EISSN: 1469-4417
  • URL: /core/journals/ergodic-theory-and-dynamical-systems
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed