Back to search
2501.05830

Monochromatic arithmetic progressions in the Fibonacci, Thue–Morse, and Rudin–Shapiro words

G. Joshi, D. Rust

correctmedium confidence
Category
math.DS
Journal tier
Strong Field
Processed
Sep 28, 2025, 12:56 AM

Audit review

The paper proves exact formulas for A(d) in two regimes—g(d) < τ^{-2} and τ^{-2} ≤ g(d) ≤ 1/2—via the rotation model of the Fibonacci word and a careful interval-intersection/step-distance analysis, yielding A(d) = ⌈τ^{-1}/g(d)⌉ (Theorem 4.6) and A(d) = 2⌈(τ^{-1} − g(d))/g(2d)⌉ (Theorem 4.15) . The candidate solution derives exactly the same two formulas by modeling f as a mechanical (Sturmian) coding and analyzing intersections E_ℓ(J,β), including an even–odd splitting that introduces g(2d). Minor differences (choice of slope parameterization) are purely conventional and do not affect the classification. The approaches and key steps (rotation coding, density, small-step nesting, and an even–odd decomposition for the large-step case) are essentially the same.

Referee report (LaTeX)

\textbf{Recommendation:} minor revisions

\textbf{Journal Tier:} strong field

\textbf{Justification:}

The paper gives a definitive, simple classification of longest MAP lengths in the Fibonacci word, blending rotation dynamics with careful step-distance analysis. The results are complete and the proofs read cleanly. Minor editorial clarifications (explicit mention of the even–odd splitting strategy, boundary matching, and slope-convention reconciliation) would enhance accessibility, but the mathematics appears correct and significant.