The automorphism group of a shift of linear growth: beyond transitivity

Abstract

For a finite alphabet A and shift X⊂eqAZ whose factor complexity function grows at most linearly, we study the algebraic properties of the automorphism group Aut(X). For such systems, we show that every finitely generated subgroup of Aut(X) is virtually Zd, in contrast to the behavior when the complexity function grows more quickly. With additional dynamical assumptions we show more: if X is transitive, then Aut(X) is virtually Z; if X has dense aperiodic points, then Aut(X) is virtually Zd. We also classify all finite groups that arise as the automorphism group of a shift.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…