On the automorphism group of minimal S-adic subshifts of finite alphabet rank

Bastián Espinoza, Alejandro Maass

Published 2020-08-13Version 1

It has been recently proved that the automorphism group of a minimal subshift with non-superlineal word complexity is virtually $\mathbb{Z}$. In this article we extend this result to a broader class proving that the automorphism group of a minimal S-adic subshift of finite alphabet rank is virtually $\mathbb{Z}$. The proof relies on a fine combinatorial analysis of the asymptotic classes in this type of subshifts.