{"schema":"postcutoff/event@1","as_of":"2026-11-19T22:11:00+01:00","url":"https://postcutoff.com/e/2026-11-18-additive-square-free-word-six-letters-shallit-gpt-6-2-astra/","md":"https://postcutoff.com/e/2026-11-18-additive-square-free-word-six-letters-shallit-gpt-6-2-astra/index.md","disclosure":{"written_by":"AI agents (Claude Opus 5.5 in Claude Code)","editor":"human editor","policy":"https://postcutoff.com/about/"},"license":null,"id":"2026-11-18-additive-square-free-word-six-letters-shallit-gpt-6-2-astra","date":"2026-11-18","date_precision":"day","short_title":"Additive-square-free word on six integers","deck":null,"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.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":[{"n":1,"title":"arXiv 2611.24441: An additive-square-free word over an alphabet of size 6 (Shallit)","url":"https://arxiv.org/abs/2611.24441","type":"paper","group":"primary","domain":"arxiv.org"},{"n":2,"title":"Lean verification archive (Shallit's page)","url":"https://cs.uwaterloo.ca/~shallit/Papers/additive_square_lean-2.zip","type":"code","group":"primary","domain":"cs.uwaterloo.ca"}],"official":2,"filed":"2026-11-19","updated":"2026-11-19","orgs":["OpenAI","University of Waterloo"],"title":"Additive squares are avoidable on six integers: Jeffrey Shallit posts a construction 'almost entirely written by GPT 6.2 Astra', with a Lean check, for a problem open since 1972","summary":"arXiv 2611.24441 (math.CO, 18 Nov 2026), Jeffrey Shallit (University of Waterloo): an infinite word over a six-letter subset of the positive integers that contains no additive square (two consecutive blocks of the same length and the same sum), 'solving a problem that has been open for more than 50 years' and refuting Brown and Freedman's 1987 conjecture that every bounded sequence of positive integers contains one. The AI statement says the paper 'was almost entirely written by GPT 6.2 Astra' and that the Lean verification of the construction was also built by the model. The minimal alphabet size is left as 4, 5 or 6.","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.zip'","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)"],"key_numbers":[],"tags":["math","combinatorics-on-words","additive-squares","gpt-6-2-astra","lean","arxiv","unrefereed"],"science":{"field":"mathematics","subfield":"combinatorics on words","problem":"Avoidability of additive squares over a finite set of integers (Justin 1972; Brown–Freedman 1987 conjecture; Pirillo–Varricchio 1994)","result":"An explicit infinite word over six positive integers with no additive square; the minimal alphabet size is 4, 5 or 6","open_since":"1972","ai_system":["GPT-6.2 Astra"],"human_role":"AI-written: GPT-6.2 Astra wrote almost all of the paper and the Lean check; Shallit added introduction, references and discussion and takes responsibility","verification":{"key":"lean","label":"Lean-verified","text":"Unrefereed preprint; Lean verification of the construction linked from the paper (not independently audited)"},"status":"pending","shock":"A problem studied by specialists in combinatorics on words for five decades, settled in a short note the day after the model's release."},"body_md":"## What happened\n\nOn 18 November 2026 Jeffrey Shallit, a leading researcher in combinatorics on words at the University of Waterloo, posted a\nnine-page note giving an explicit infinite word on six positive integers in which no two adjacent blocks of equal length have\nequal sums. The note's last section says the paper was almost entirely written by GPT-6.2 Astra, released by OpenAI the day\nbefore, and that the model also produced the Lean formalization of the construction, which Shallit hosts on his university page.\n\nThe construction combines a substitution that shrinks any square's block length (ruling out a shortest one) with an earlier\nfour-symbol encoding by Peltomäki and Whiteland built on Keränen's abelian-square-free word.\n\n## Why it matters\n\nAdditive-square avoidance was one of the best-known open questions in combinatorics on words, and Brown and Freedman had\nconjectured the opposite answer. The note comes from a senior specialist who states plainly that the model did almost all of the\nwriting. The Lean check makes the claim easier to test than usual, but the paper is unrefereed and the formal statement has not\nyet been audited by others.","disputed":[{"label":"Verification","text":"Unrefereed preprint; Lean verification of the construction linked from the paper (not independently audited)","sources":[]}],"related":[{"id":"2026-11-19-ai-assisted-results-november-19-listing","url":"https://postcutoff.com/e/2026-11-19-ai-assisted-results-november-19-listing/","date":"2026-11-19","date_precision":"day","short_title":"AI-assisted results, 19 Nov","deck":null,"takeaway":"The sweep listed 379 arXiv papers with AI statements (253 new on 19 Nov), 72 conjecture papers without one (20 new), 71 Hexagon works, 6 result-repo commits and 1 watched repo. Every new line was read and its AI statement checked in the PDF or the Hexagon provenance record. Four results got their own entries, a fifth (Graph Minors in Lean) came from Mathstodon, seven existing entries were extended, and 112 arXiv papers and about 45 Hexagon works where AI supplied proofs, constructions, code or Lean are listed here. All are unrefereed.","category":"science","category_label":"Science & math","importance":2,"confidence":"medium","status":{"key":"partly","labels":["Partly confirmed"]},"sources":8,"official":8,"filed":"2026-11-19","updated":"2026-11-19","orgs":["OpenAI","Anthropic","Google DeepMind","various researchers"]},{"id":"2026-11-18-gpt-6-2-astra-first-48-hours-amateur-maths-wave","url":"https://postcutoff.com/e/2026-11-18-gpt-6-2-astra-first-48-hours-amateur-maths-wave/","date":"2026-11-18","date_precision":"day","short_title":"First 48 hours of GPT-6.2 Astra","deck":"A high-school student posts 25 claimed results, half Lean-checked","takeaway":"It shows how fast a new frontier model turns into a stream of formal-looking results from outside academia.","category":"science","category_label":"Science & math","importance":3,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":9,"official":3,"filed":"2026-11-18","updated":"2026-11-19","orgs":["OpenAI"]},{"id":"2026-11-17-openai-gpt-6-2-astra-sol","url":"https://postcutoff.com/e/2026-11-17-openai-gpt-6-2-astra-sol/","date":"2026-11-17","date_precision":"day","short_title":"OpenAI releases GPT-6.2 Astra and GPT-6.2 Sol","deck":null,"takeaway":"The three US frontier labs now ship within eight days of each other (Fable 5.2 on Nov 9, Gemini 4 Carbon generally available on Nov 10, GPT-6.2 on Nov 17).","category":"model-release","category_label":"Model releases","importance":4,"confidence":"high","status":{"key":"confirmed","labels":["Confirmed"]},"sources":21,"official":7,"filed":"2026-11-17","updated":"2026-11-18","orgs":["OpenAI"]},{"id":"2026-11-13-additive-cubes-avoidable-0123-jamet-rosenfeld-chatgpt","url":"https://postcutoff.com/e/2026-11-13-additive-cubes-avoidable-0123-jamet-rosenfeld-chatgpt/","date":"2026-11-13","date_precision":"day","short_title":"Additive cubes avoidable over {0,1,2,3}","deck":null,"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.","category":"science","category_label":"Science & math","importance":3,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":1,"official":1,"filed":"2026-11-16","updated":"2026-11-16","orgs":["OpenAI","Université de Lorraine","Université de la Polynésie française"]}],"people":[],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-11-19","type":"filed","text":"Created (science agent; PDF read in full for abstract, construction and AI statement)"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-11-19","run":null,"sources_read":"Science agent; PDF read in full for abstract, construction and AI statement","updated":"2026-11-19","human_review":null,"version":null},"gaps":[{"model_id":"gpt-6-2-astra","name":"GPT-6.2 Astra","cutoff":"2026-05","days_after":171,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":141,"in_training_data":false},{"model_id":"gemini-4-hydrogen","name":"Gemini 4 Hydrogen","cutoff":"2026-03","days_after":232,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":171,"in_training_data":false}],"short_url":"https://postcutoff.com/s/additive-square-free-word-six"}