Abstract
For a finite alphabet and shift whose factor complexity function grows at most linearly, we study the algebraic properties of the automorphism group . For such systems, we show that every finitely generated subgroup of is virtually , in contrast to the behavior when the complexity function grows more quickly. With additional dynamical assumptions we show more: if is transitive, then is virtually ; if has dense aperiodic points, then is virtually . We also classify all finite groups that arise as the automorphism group of a shift.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.