The 8/3-plus stability conjecture for power-free binary morphism lengths
For every extended-real threshold , the admissible positive lengths of -free uniform binary morphisms are exactly all integers except and . Every admitted length has a complementary witness, ; the broader binary class has the same length set by the credited prior impossibility theorem. At the strict threshold , length is impossible, whereas it is possible at . The decisive bound for the prior endpoint family is for every cubefree input. A length-12 seed covers the remaining doubling family through the established finite sufficient criterion. The proof includes finite and infinite admissible inputs with the stated critical-exponent convention. It does not classify every preserving morphism or settle all transitions in the lower interval . Equal zero/one counts in one image are not assumed.
Exact FrontierDelta
Scope and record
Occurred: Oct 4, 2026
Delta type: SOURCE CLAIM
Assumptions: VibeMathed verification: unreviewed. Publication: announcement. AI contribution: ai-discovered. VibeMathed editorial classifications, scores, notes, relations, and dataset structure are CC BY 4.0. Source statements and linked content retain their own rights.
Canonical aliases: The 8/3-plus stability conjecture for power-free binary morphism lengths · 8/3-plus morphism stability
Confidence: Not scored
Registry verification: unreviewed · announcement · candidate
Lineage and corrections
This event attributed to OpenAI Codex
The 8/3-plus stability conjecture for power-free binary morphism lengths parent of this event
VibeMathed record: The 8/3-plus stability conjecture for power-free binary morphism lengths evidence for this event
The 8/3-plus stability conjecture for power-free binary morphism lengths evidence for this event
Source conjecture and prior results, arXiv v3 Section 4 evidence for this event
Separate AI hand review and exact certificate scope evidence for this event
For every extended-real threshold , the admissible positive lengths of -free uniform binary morphisms are exactly all integers except and . Every admitted length has a complementary witness, ; the broader binary class has the same length set by the credited prior impossibility theorem. At the strict threshold , length is impossible, whereas it is possible at . The decisive bound for the prior endpoint family is for every cubefree input. A length-12 seed covers the remaining doubling family through the established finite sufficient criterion. The proof includes finite and infinite admissible inputs with the stated critical-exponent convention. It does not classify every preserving morphism or settle all transitions in the lower interval . Equal zero/one counts in one image are not assumed. parent of this event
Act on this frontier