A complete characterization of recurrent pattern Sturmian sequences as either simple circle rotation codings or members of nearly simple Toeplitz subshifts.
On minimal subshifts of linear word complexity with slope less than 3/2
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We prove that every infinite minimal subshift with word complexity $p(q)$ satisfying $\limsup p(q)/q < 3/2$ is measure-theoretically isomorphic to its maximal equicontinuous factor; in particular, it has measurably discrete spectrum. Among other applications, this provides a proof of Sarnak's conjecture for all subshifts with $\limsup p(q)/q < 3/2$ (which can be thought of as a much stronger version of zero entropy). As in \cite{creutzpavlov}, our main technique is proving that all low-complexity minimal subshifts have a specific type of representation via a sequence $\{\tau_k\}$ of substitutions, usually called an S-adic decomposition. The maximal equicontinuous factor is the product of an odometer with a rotation on a compact abelian connected one-dimensional group, for which we can give an explicit description in terms of the substitutions $\tau_k$. We also prove that all such odometers and groups may appear for minimal subshifts with $\limsup p(q)/q = 1$, demonstrating that lower complexity thresholds do not further restrict the possible structure.
citation-role summary
citation-polarity summary
fields
math.DS 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
On subshifts with low maximal pattern complexity
A complete characterization of recurrent pattern Sturmian sequences as either simple circle rotation codings or members of nearly simple Toeplitz subshifts.