combinatorics / Combinatorics on words; automatic sequences and arithmetic progressions

Thue–Morse: all three Joshi–Rust first-occurrence formulas

All three displayed first-occurrence families are proved in the stated ranges. The proof also gives exact all-start classifications for the plus and even-minus families, and rederives their established maximal-length values without assuming those values as hypotheses. For q=2m,m≥2q=2^m, m≥2, every length-(q+2)(q+2) progression at difference q+1q+1 starts at lq2−q−1lq²−q−1 with l≥1l≥1 and t(l−1)=t(l+1)=1−t(l)t(l−1)=t(l+1)=1−t(l). For even m≥2m≥2, every length-(q+4)(q+4) progression at difference q−1q−1 starts at lq2−q+1lq²−q+1 with the same condition. Its least ll is 33. For odd mm, the earliest length-qq progression at difference q−1q−1 starts at q−1q−1. Global maximality and exclusion of every earlier start are included. The prior length results and block-recognition methods of Parshina and Aedo–Grimm–Nagai–Staynova are explicitly credited. This is the first-occurrence conjecture, distinct from the existing avoiding-population matching-height entry. Broader all-difference classifications are not claimed.

6Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

combinatoricsOct 4, 2026Significance 6/100Registry: lean checked

Thue–Morse: all three Joshi–Rust first-occurrence formulas

Prior state unknown→proved

All three displayed first-occurrence families are proved in the stated ranges. The proof also gives exact all-start classifications for the plus and even-minus families, and rederives their established maximal-length values without assuming those values as hypotheses. For q=2m,m≥2q=2^m, m≥2, every length-(q+2)(q+2) progression at difference q+1q+1 starts at lq2−q−1lq²−q−1 with l≥1l≥1 and t(l−1)=t(l+1)=1−t(l)t(l−1)=t(l+1)=1−t(l). For even m≥2m≥2, ever…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

All three displayed first-occurrence families are proved in the stated ranges. The proof also gives exact all-start classifications for the plus and even-minus families, and rederives their established maximal-length values without assuming those values as hypotheses. For q=2m,m≥2q=2^m, m≥2, every length-(q+2)(q+2) progression at difference q+1q+1 starts at lq2−q−1lq²−q−1 with l≥1l≥1 and t(l−1)=t(l+1)=1−t(l)t(l−1)=t(l+1)=1−t(l). For even m≥2m≥2, every length-(q+4)(q+4) progression at difference q−1q−1 starts at lq2−q+1lq²−q+1 with the same condition. Its least ll is 33. For odd mm, the earliest length-qq progression at difference q−1q−1 starts at q−1q−1. Global maximality and exclusion of every earlier start are included. The prior length results and block-recognition methods of Parshina and Aedo–Grimm–Nagai–Staynova are explicitly credited. This is the first-occurrence conjecture, distinct from the existing avoiding-population matching-height entry. Broader all-difference classifications are not claimed.

All three displayed first-occurrence families are proved in the stated ranges. The proof also gives exact all-start classifications for the plus and even-minus families, and rederives their established maximal-length values without assuming those values as hypotheses. For q=2m,m≥2q=2^m, m≥2, every length-(q+2)(q+2) progression at difference q+1q+1 starts at lq2−q−1lq²−q−1 with l≥1l≥1 and t(l−1)=t(l+1)=1−t(l)t(l−1)=t(l+1)=1−t(l). For even m≥2m≥2, every length-(q+4)(q+4) progression at difference q−1q−1 starts at lq2−q+1lq²−q+1 with the same condition. Its least ll is 33. For odd mm, the earliest length-qq progression at difference q−1q−1 starts at q−1q−1. Global maximality and exclusion of every earlier start are included. The prior length results and block-recognition methods of Parshina and Aedo–Grimm–Nagai–Staynova are explicitly credited. This is the first-occurrence conjecture, distinct from the existing avoiding-population matching-height entry. Broader all-difference classifications are not claimed.

Recorded attempts

Evidence graph

Connected research record

Thue–Morse: all three Joshi–Rust first-occurrence formulas — Mathematical Frontier Network