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

From MaRDI portal
Publication:5095130



Abstract: It has been recently proved that the automorphism group of a minimal subshift with non-superlinear word complexity is virtually mathbbZ [DDPM15, CK15]. 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 mathbbZ. The proof is based on a fine combinatorial analysis of the asymptotic classes in this type of subshifts, which we prove are a finite number.












This page was built for publication: On the automorphism group of minimal \(\mathcal{S}\)-adic subshifts of finite alphabet rank

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5095130)