On automorphism groups of low complexity subshifts

By Sebastian Donoso, Fabien Durand, Alejandro Maass, S. Petite. Ergodic Theory and Dynamical Systems, 2015

88 citations recorded by the source corpus.

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

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/bbbb67cd4316208cb24eb54acf41c3529e1b769c

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Van Cyr
  2. Bryna Kra

In Computational Theory and Mathematics

  1. Van Cyr
  2. Bryna Kra

Citations in the corpus