On subshifts with low maximal pattern complexity
Anh N. Le, Ronnie Pavlov, and Casey Schlortt

TL;DR
This paper characterizes recurrent pattern Sturmian sequences as either codings of irrational circle rotations or nearly simple Toeplitz subshifts, using topological properties of their maximal equicontinuous factors.
Contribution
It provides a complete classification of recurrent pattern Sturmian sequences and introduces a new technique involving the maximal equicontinuous factor.
Findings
Recurrent pattern Sturmian sequences are either codings of irrational circle rotations or nearly simple Toeplitz subshifts.
Nonrecurrent pattern Sturmian sequences are either close to constant or codings of irrational circle rotations.
Sequences with non-superlinear maximal pattern complexity are either nonrecurrent or minimal with specific maximal equicontinuous factors.
Abstract
For a finite alphabet and a sequence , Kamae and Zamboni defined the maximal pattern complexity function as a natural generalization of usual word complexity. They defined a nonperiodic sequence to be pattern Sturmian if it achieves the minimal growth rate , and asked the question of whether one could classify recurrent pattern Sturmian sequences. We answer their question by characterizing recurrent pattern Sturmian sequences as one of two known types: either a coding of an irrational circle rotation by two intervals, or an element of what we call a nearly simple Toeplitz subshift. We also show that nonrecurrent pattern Sturmian sequences are either very close to constant (such examples were given by Kamae and Zamboni) or a (nonrecurrent) coding of an irrational circle rotation by two intervals. Our main…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
