Additive-square-free word on six integers
Awaiting review
Importance: major (4 of 5)The takeaway
Can an infinite word over a finite set of integers avoid two adjacent blocks with equal length and equal sum? The question goes back to Justin (1972) and Brown and Freedman (1987), who conjectured it cannot. Shallit gives an explicit word on six positive integers that does, says the paper was ‘almost entirely written by GPT 6.2 Astra’, and links a Lean verification the model also built. Unrefereed.
Status
- Claim
Awaiting review
- Our reporting
- Medium confidence
- Verification
- Lean-verified
- Importance
- Major (4 of 5)
- Last verified
- 19 November 2026
Your AI and this story
- GPT-6.2 Astra171 days after its cutoff
- Claude Opus 5.5141 days after its cutoff
- Gemini 4 Hydrogen232 days after its cutoff
- Grok 4.7171 days after its cutoff
None of these four assistants can know about it. The closest, Claude Opus 5.5, stops 141 days before it.
Key facts
- Claim (abstract): ‘Solving a problem that has been open for more than 50 years, we give an example of an infinite word over a 6-letter subset of N that avoids additive squares’
- History given in the paper: posed in different forms by Justin (1972), Brown and Freedman (1987), Pirillo and Varricchio (1994) and Halbeisen and Hungerbühler (2000); Brown and Freedman ‘conjectured that every bounded sequence of positive integers contains an additive square’
- Construction: an auxiliary word built by iterated block substitution (block length divided by q under any square), then encoded with a four-symbol construction of Peltomäki and Whiteland using Keränen’s 85-symbol abelian-square-free substitution; the six letters are explicit (very large) integers built from the length L = 2·85^11 of the eleventh iterate
- Open after the paper: the least alphabet size ‘is either 4, 5, or 6’
- AI statement (verbatim): ‘This paper was almost entirely written by GPT 6.2 Astra. I added some introductory and material, references, and discussion. I take full responsibility for the correctness. A Lean verification of the construction, also constructed by GPT 6.2 Astra, is available at https://cs.uwaterloo.ca/~shallit/Papers/additive_square_lean-2.zip2'
- Context: GPT-6.2 Astra was released on 17 Nov 2026, the day before the submission; five days earlier Jamet and Rosenfeld had shown additive cubes avoidable over {0,1,2,3} after a ChatGPT suggestion (2026-11-13 entry). Additive squares are a strictly stronger requirement than additive cubes
- Reactions: none found by 19 Nov evening (HN, Mathstodon, Shallit’s blog Recursivity, web search)
What happened
On 18 November 2026 Jeffrey Shallit, a leading researcher in combinatorics on words at the University of Waterloo, posted a nine-page note giving an explicit infinite word on six positive integers in which no two adjacent blocks of equal length have equal sums. The note’s last section says the paper was almost entirely written by GPT-6.2 Astra, released by OpenAI the day before, and that the model also produced the Lean formalization of the construction, which Shallit hosts on his university page.
The construction combines a substitution that shrinks any square’s block length (ruling out a shortest one) with an earlier four-symbol encoding by Peltomäki and Whiteland built on Keränen’s abelian-square-free word.
Why it matters
Additive-square avoidance was one of the best-known open questions in combinatorics on words, and Brown and Freedman had conjectured the opposite answer. The note comes from a senior specialist who states plainly that the model did almost all of the writing. The Lean check makes the claim easier to test than usual, but the paper is unrefereed and the formal statement has not yet been audited by others.
What is disputed or not yet verified
| Verification | Unrefereed preprint; Lean verification of the construction linked from the paper (not independently audited) |
|---|
Sources
2 sources from 2 sites. Numbers match the chips in the text.
2 sources: 2 primary
Primary
- arXiv 2611.24441: An additive-square-free word over an alphabet of size 6 (Shallit)arxiv.org, paper
- Lean verification archive (Shallit’s page)cs.uwaterloo.ca, code
Changes
- Filed (science agent; PDF read in full for abstract, construction and AI statement)