We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
We provide an explicit $\mathcal {S}$-adic representation of rank-one subshifts with bounded spacers and call the subshifts obtained in this way ‘minimal Ferenczi subshifts’. We aim to show that this approach is very convenient to study the dynamical behavior of rank-one systems. For instance, we compute their topological rank, the strong and the weak orbit equivalence class. We observe that they have an induced system that is a Toeplitz subshift having discrete spectrum. We also characterize continuous and non-continuous eigenvalues of minimal Ferenczi subshifts.
It has been recently proved that the automorphism group of a minimal subshift with non-superlinear word complexity is virtually
$\mathbb {Z}$
[Cyr and Kra. The automorphism group of a shift of linear growth: beyond transitivity. Forum Math. Sigma3 (2015), e5; Donoso et al. On automorphism groups of low complexity subshifts. Ergod. Th. & Dynam. Sys.36(1) (2016), 64–95]. In this article we extend this result to a broader class proving that the automorphism group of a minimal
$\mathcal {S}$
-adic subshift of finite alphabet rank is virtually
$\mathbb {Z}$
. 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.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.