A complete characterization of recurrent pattern Sturmian sequences as either simple circle rotation codings or members of nearly simple Toeplitz subshifts.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.DS 1years
2025 1verdicts
CONDITIONAL 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.