Pith. sign in

REVIEW 1 cited by

On minimal subshifts of linear word complexity with slope less than 3/2

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2308.14901 v2 pith:IT3EDKXZ submitted 2023-08-28 math.DS

classification math.DS
keywords minimalsubshiftscomplexitylimsupequicontinuousfactormaximalprove
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. On subshifts with low maximal pattern complexity

    math.DS 2025-08 conditional novelty 8.0 of 10

    A complete characterization of recurrent pattern Sturmian sequences as either simple circle rotation codings or members of nearly simple Toeplitz subshifts.

Pith tools