Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-14T11:55:16.009Z Has data issue: false hasContentIssue false
  • English
  • Français

On automorphism groups of low complexity subshifts

Published online by Cambridge University Press:  27 November 2015

SEBASTIÁN DONOSO,
FABIEN DURAND,
ALEJANDRO MAASS and
SAMUEL PETITE
SEBASTIÁN DONOSO
Affiliation:
Departamento de Ingeniería Matemática, Universidad de Chile, Beauchef 851, Santiago, ChileUniversité Paris-Est, Laboratoire d’Analyse et de Mathématiques Appliquées, 5 bd Descartes, 77454 Marne la Vallée Cedex 2, France email sdonoso@dim.uchile.cl, sebastian.donoso@univ-paris-est.fr
FABIEN DURAND
Affiliation:
Laboratoire Amiénois de Mathématiques Fondamentales et Appliquées, CNRS-UMR 7352, Université de Picardie Jules Verne, 33 rue Saint Leu, 80039 Amiens Cedex 1, France email fabien.durand@u-picardie.fr, samuel.petite@u-picardie.fr
ALEJANDRO MAASS
Affiliation:
Departamento de Ingeniería Matemática and Centro de Modelamiento Matemático, CNRS-UMI 2807, Universidad de Chile, Beauchef 851, Santiago, Chile email amaass@dim.uchile.cl
SAMUEL PETITE
Affiliation:
Laboratoire Amiénois de Mathématiques Fondamentales et Appliquées, CNRS-UMR 7352, Université de Picardie Jules Verne, 33 rue Saint Leu, 80039 Amiens Cedex 1, France email fabien.durand@u-picardie.fr, samuel.petite@u-picardie.fr
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this article, we study the automorphism group $\text{Aut}(X,{\it\sigma})$ of subshifts $(X,{\it\sigma})$ of low word complexity. In particular, we prove that $\text{Aut}(X,{\it\sigma})$ is virtually $\mathbb{Z}$ for aperiodic minimal subshifts and certain transitive subshifts with non-superlinear complexity. More precisely, the quotient of this group relative to the one generated by the shift map is a finite group. In addition, we show that any finite group can be obtained in this way. The class considered includes minimal subshifts induced by substitutions, linearly recurrent subshifts and even some subshifts which simultaneously exhibit non-superlinear and superpolynomial complexity along different subsequences. The main technique in this article relies on the study of classical relations among points used in topological dynamics, in particular, asymptotic pairs. Various examples that illustrate the technique developed in this article are provided. In particular, we prove that the group of automorphisms of a $d$-step nilsystem is nilpotent of order $d$ and from there we produce minimal subshifts of arbitrarily large polynomial complexity whose automorphism groups are also virtually $\mathbb{Z}$.

Information

Type
Research Article
Information
Ergodic Theory and Dynamical Systems , Volume 36 , Issue 1 , February 2016, pp. 64 - 95
Copyright
© Cambridge University Press, 2015 

References

Arnoux, P. and Mauduit, C.. Complexité de suites engendrées par des récurrences unipotentes. Acta Arith. 76 (1996), 85–97.CrossRefGoogle Scholar
Auslander, J.. Endomorphisms of minimal sets. Duke Math. J. 30 (1963), 605–614.CrossRefGoogle Scholar
Auslander, J.. Minimal Flows and Their Extensions (North-Holland Mathematics Studies, 153). North-Holland, Amsterdam, 1988, 265pp.Google Scholar
Auslander, L., Green, L. and Hahn, F.. Flows on homogeneous spaces. Annals of Mathematics Studies. Princeton University Press, Princeton, NJ, 1963, 107pp; with the assistance of L. Markus and W. Massey, and an appendix by L. Greenberg.Google Scholar
Barge, M. and Diamond, B.. A complete invariant for the topology of one-dimensional substitution tiling spaces. Ergod. Th. & Dynam. Sys. 21 (2001), 1333–1358.CrossRefGoogle Scholar
Boyle, M., Lind, D. and Rudolph, D.. The automorphism group of a shift of finite type. Trans. Amer. Math. Soc. 306 (1988), 71–114.CrossRefGoogle Scholar
Cassaigne, J.. Complexité et facteurs spéciaux. Bull. Belg. Math. Soc. 4 (1997), 67–88.Google Scholar
Cassaigne, J.. Sequences with grouped factors. Developments in Language Theory III (DLT’97). Aristotle University of Thessaloniki, 1998, pp. 211–222.Google Scholar
Coven, E. M.. Endomorphisms of substitution minimal sets. Z. Wahrschein. Verw. Gebiete 20 (1971/72), 129–133.CrossRefGoogle Scholar
Coven, E., Quas, A. and Yassawi, R.. Automorphisms of some Toeplitz and other minimal shifts with sublinear complexity. Preprint, 2015, arXiv:1505.02482.Google Scholar
Cyr, V. and Kra, B.. The automorphism group of a shift of subquadratic growth. Proc. Amer. Math. Soc., to appear, arXiv:1403.0238.Google Scholar
Cyr, V. and Kra, B.. The automorphism group of a shift of linear growth. Forum of Mathematics, Sigma 3 (2015), e5.CrossRefGoogle Scholar
del Junco, A.. A simple measure-preserving transformation with trivial centralizer. Pacific J. Math. 79 (1978), 357–362.CrossRefGoogle Scholar
Donoso, S. and Sun, W.. Dynamical cubes and a criteria for systems having products extensions. Preprint, 2014, arXiv:1406.1220.Google Scholar
Downarowicz, T.. Survey of odometers and Toeplitz flows. Algebraic and Topological Dynamics (Contemporary Mathematics, 385). American Mathematical Society, Providence, RI, 2005, pp. 7–37.CrossRefGoogle Scholar
Durand, F.. Linearly recurrent subshifts have a finite number of nonperiodic factors. Ergod. Th. & Dynam. Sys. 20 (2000), 1061–1078.CrossRefGoogle Scholar
Ferenczi, S.. Systems of finite rank. Colloq. Math. 73 (1997), 35–65.CrossRefGoogle Scholar
Fiebig, D. and Fiebig, U.. The automorphism group of a coded system. Trans. Amer. Math. Soc. 348 (1996), 3173–3191.CrossRefGoogle Scholar
Hedlund, G. A.. Endomorphisms and automorphisms of the shift dynamical system. Math. System. Theory 3 (1969), 320–375.CrossRefGoogle Scholar
Hedlund, G. A. and Morse, M.. Symbolic dynamics II. Sturmian trajectories. Amer. J. Math. 62 (1940), 1–42.Google Scholar
Hochman, M.. On the automorphism groups of multidimensional shifts of finite type. Ergod. Th. & Dynam. Sys. 30 (2010), 809–840.CrossRefGoogle Scholar
Host, B., Kra, B. and Maass, A.. Nilsequences and a structure theorem for topological dynamical systems. Adv. Math. 224 (2010), 103–129.CrossRefGoogle Scholar
Host, B. and Parreau, F.. Homomorphismes entre systèmes dynamiques définies par substitutions. Ergod. Th. & Dynam. Sys. 9 (1989), 469–477.CrossRefGoogle Scholar
Kim, K. H. and Roush, F. W.. On the automorphism groups of subshifts. Pure Math. Appl. Ser. B 1 (1990), 203–230.Google Scholar
King, J. and Thouvenot, J.-P.. A canonical structure theorem for finite joining-rank maps. J. Anal. Math. 56 (1991), 211–230.CrossRefGoogle Scholar
Kůrka, P.. Topological and symbolic dynamics. Cours Spécialisés 11. Société Mathématique de France, Paris, 2003.Google Scholar
Leibman, A.. Pointwise convergence of ergodic averages for polynomial sequences of translations on a nilmanifold. Ergod. Th. & Dynam. Sys. 25 (2005), 201–213.CrossRefGoogle Scholar
Lemańczyk, M. and Mentzen, M.. On metric properties of substitutions. Compos. Math. 65 (1988), 241–263.Google Scholar
Mossé, B.. Puissances de mots et reconnaissabilité des points fixes d’une substitution. Theoret. Comput. Sci. 99 (1992), 327–334.CrossRefGoogle Scholar
Mossé, B.. Reconnaissabilité des substitutions et complexité des suites automatiques. Bull. Soc. Math. France 124 (1996), 329–346.CrossRefGoogle Scholar
Olli, J.. Endomorphisms of Sturmian systems and the discrete chair substitution tiling system. Discrete Contin. Dyn. Syst. 33 (2013), 4173–4186.CrossRefGoogle Scholar
Ornstein, D.. On the root problem in ergodic theory. Proceedings of the Sixth Berkeley Symposium on Mathematical Statistics and Probability (University of California, Berkeley, CA, 1970/1971) (Vol. II: Probability Theory). University of California Press, Berkeley, CA, 1972, pp. 347–356.Google Scholar
Pansiot, J.-J.. Complexité des facteurs des mots infinis engendrés par morphismes itérés. Automata, Languages and Programming (Lecture Notes in Computational Science, 172). Springer, Berlin, 1984, pp. 380–389.CrossRefGoogle Scholar
Parry, W.. Ergodic properties of affine transformations and flows on nilmanifolds. Amer. J. Math. 91 (1969), 757–771.CrossRefGoogle Scholar
Quas, A. and Zamboni, L.. Periodicity and local complexity. Theoret. Comput. Sci. 319 (2004), 229–240.CrossRefGoogle Scholar
Queffélec, M.. Substitution Dynamical Systems–Spectral Analysis (Lecture Notes in Mathematics, 1294). Springer, Berlin, 1987.CrossRefGoogle Scholar
Salo, V. and Törmä, I.. Block maps between primitive uniform and Pisot substitutions. Ergod. Th. & Dynam. Sys., to appear. doi:10.1017/etds.2014.29. Published online 4 August 2014.CrossRefGoogle Scholar
Shalom, Y. and Tao, T.. A finitary version of Gromov’s polynomial growth theorem. Geom. Funct. Anal. 20 (2010), 1502–1547.CrossRefGoogle Scholar
Shao, S. and Ye, X.. Regionally proximal relation of order d is an equivalence one for minimal systems and a combinatorial consequence. Adv. Math. 231 (2012), 1786–1817.CrossRefGoogle Scholar
Walters, P.. Topological conjugacy of affine transformations of tori. Trans. Amer. Math. Soc. 131 (1968), 40–50.CrossRefGoogle Scholar
Ward, T.. Automorphisms of ℤd-subshifts of finite type. Indag. Math. (N.S.) 5 (1994), 495–504.CrossRefGoogle Scholar