Additive cubes avoidable over {0,1,2,3}
Awaiting review
The takeaway
Whether an infinite word over {0,1,2,3} can avoid three consecutive blocks with equal length and equal sum was open since 1994. Jamet and Rosenfeld prove it can, with eight explicit morphisms. They write that ChatGPT (GPT-6) ‘played a notable role in initiating this work’ by proposing the first candidate morphism, without proof.
Status
- Claim
Awaiting review
- Our reporting
- Medium confidence
- Verification
- Preprint only
- Importance
- 3 of 5
- Last verified
- 16 November 2026
Your AI and this story
- GPT-6.2 Astra166 days after its cutoff
- Claude Opus 5.5136 days after its cutoff
- Gemini 4 Hydrogen227 days after its cutoff
- Grok 4.7166 days after its cutoff
None of these four assistants can know about it. The closest, Claude Opus 5.5, stops 136 days before it.
Key facts
- Claim (abstract): ‘We prove that additive cubes are avoidable over the alphabet {0, 1, 2, 3}, thereby solving a long-standing question initiated by Pirillo and Varricchio in 1994’; eight explicit length-3 morphisms whose images of the Cassaigne et al. word contain no additive cubes
- Disclaimer (verbatim): ‘ChatGPT (OpenAI, GPT-6) played a notable role in initiating this work. When consulted by the second author regarding the avoidability of additive cubes over {0, 1, 2, 3}, it suggested a first candidate morphism, τ1 … without a proof of correctness. The authors then proved that the infinite word τ1(w) is additive-cube-free and conducted an exhaustive search’
- Context: Cassaigne, Currie, Schaeffer and Shallit (2014) had shown avoidability over {0,1,3,4}
- How found: the sweep listed it among conjecture papers with no AI disclosure; the PDF scan found the ‘Disclaimer’ section
What happened
Jamet and Rosenfeld posted a proof that there is an infinite word over {0,1,2,3} with no additive cube. The starting point was a morphism that ChatGPT proposed when Rosenfeld asked about the problem; the authors proved it works and found seven more.
Why it matters
The four-letter alphabet {0,1,2,3} was the best-known open case of the question. The result is a small, checkable example of a model supplying the key construction.
What is disputed or not yet verified
| Verification | Unrefereed preprint; computer-checked graph traversal |
|---|
Sources
1 source from 1 site. Numbers match the chips in the text.
1 source: 1 primary
Primary
Changes
- Filed (science agent)