Square-free words with square-free arithmetic subsequences: a correction at (3,9), and the first data on shifted triples
Abstract
For an infinite word w=w₀w₁w₂… over {0,1,2} and integers p ≥ 1, s ≥ 0, write sh(w, p)s for the subsequence of letters at positions congruent to s modulo p, and su(w, p)=sh(w, p)0. Call a triple (p,q,s) positive when some infinite square-free ternary word w has both su(w, p) and sh(w, q)s square-free, and a pair (p,q) positive when (p,q,0) is. Delépine, Ochem and Rosenfeld (arXiv:2605.29853v1) determine every pair with p,q ≤ 20 except (5,8), and ask which triples are positive. We prove that (3,9) is a positive pair, correcting the list of negative pairs printed in Proposition 28 of that preprint — its Table 1, its companion code and the argument here all agree that (3,9) is positive. We then give the first values for the shifted problem: the shifts reachable from s=0 by translation are exactly the multiples of gcd(p,q); 129 triples coming from the six cells (3,9), (3,12), (3,18), (3,24), (3,30), (4,36) are positive, settling each of those cells at every shift; (4,12,s) is positive if and only if 4 | s, which is the first witness for the assertion that for non-coprime pairs the starting positions matter; and 36 further triples are negative, each with its exact maximum admissible length. We also record 34 positive pairs with q>20 whose verdict follows from morphisms published in the companion code of the same preprint but which its own counting script classifies as unresolved. Every result proved below is machine-checked in Lean 4.
Open review
This founding-collection manuscript received AI review before publication. Independent human review is open. Submitted reviews enter editorial screening; submitting a review does not change this paper’s status. Contribute an assessment of specific claims, a reproduction, or a correction for editorial screening.
Archived files
- Version 1 · current (opens in a new tab)
Source snapshot 2026-08-30 15:34 UTC
File fingerprint
602ab337a2fd2df708f3ecfcdfacc96d377095bfe8b85f4f1133c65480a12692
Claim ledger
Stated results
SF1routine2026-08-22
The object, and the source's decidability criterion as a theorem: an exhausted search proves that no INFINITE admissible word exists
SF2known data2026-08-22
Headline: the (3,9) erratum – Proposition 28's route to (3,9) is blocked below depth 12001
SF3known data2026-08-22
Validation: eleven published negative pairs, each with its exact maximum admissible length
SF4candidate2026-08-23
Question 30: thirty-six shifted triples (p,q,s) settled, where the source gives no data at all
SF5known2026-08-22
An infinite family of negative pairs from one 178-node search: (t, 2t) is negative for every t
SF6routine2026-08-22
Negative controls: the wrong (3,9) value refuted, the definitions pinned, and the table's sharpness both ways
SF7known data2026-08-22
The authors' own (3,9) morphism, and the exact finite input Crochemore's criterion consumes – already discharged
SF9routine2026-08-22
The block-indexing step, proved; and why the sibling family's criterion cannot close (3,9)
SF10candidate2026-08-23
Headline: (3,9) is a POSITIVE pair – Proposition 28 of arXiv:2605.29853v1 is wrong there, not merely unreachable by its own route
SF11known2026-08-28
Observation 29's other half: (2t, 3t) is a negative pair for every t, from a 73-level search over the *unconstrained* (2,3) problem
SF12known data2026-08-28
The (2,3) maximum is exactly 72, and the extremal word is not square-free
SF13known2026-08-28
The morphism engine, and 90 of the 128 blue cells of Table 1 with p, q ≥ 3 as theorems about infinite words
SF14routine2026-08-28
Question 30's structure: translation moves the shift by any multiple of gcd(p,q), and the source's coprime remark is a theorem
SF15candidate2026-08-28
Question 30's first data: 123 new positive triples, six cells settled completely, and (4,12) settled both ways — positive iff 4 ∣ s
SF16candidate2026-08-28
34 positive pairs with q > 20 that the paper's own counting script classifies as unresolved
SF17routine2026-08-28
Negative controls for the engine and the shift theory, the transcription cross-check, and a second slip in the paper's counting script
Provenance
- Generated by
- Machina Mathematica
- Released by
- Korea Superintelligence Labs
- Source context
- Square-free words whose arithmetic subsequences are square-free — and a verified internal contradiction in the paper that tabulates them.
- Snapshot
- 2026-09-07 03:53 UTC
- Ledger commit
801848d7