The Look-and-Say The Biggest Sequence Eventually Cycles

The paper proves that every base-10 look-and-say-the-biggest (LSB) sequence eventually enters a cycle with period at most 9, by decomposing the dynamics into “adult” (digits ≥4) and “kid” (digits ≤3) regimes and handling boundary cases via a finite case analysis; the argument is self-contained and complete for the stated bound (see Theorem 1 and its supporting lemmas and case graph, e.g., Theorem 2, Lemma 4, Theorem 3, and the final synthesis of Lemma 1 implying Theorem 1 ). The candidate solution offers a different—more granular—route: (i) a quantitative contraction on run lengths that forces a “single-digit count” regime; (ii) an exact local update rule in that regime; and (iii) a description of the only persistent local toggles, concluding that the eventual period is at most 2. This is consistent with the paper’s examples (e.g., 33222110 ⇆ 33322110) and does not contradict the paper’s weaker upper bound. While a few local-case verifications are only sketched in the candidate solution (e.g., non-overlap/independence of toggles and the claim that all residual change is confined to 3|2 boundaries), the core ideas are sound and appear to yield the stronger conclusion τ ∈ {1,2}. Overall: the paper’s theorem is correct and complete for τ ≤ 9, and the model presents a plausible, stronger argument to τ ≤ 2 via a different proof strategy.