{"schema":"postcutoff/event@1","as_of":"2026-11-19T22:11:00+01:00","url":"https://postcutoff.com/e/2026-11-13-additive-cubes-avoidable-0123-jamet-rosenfeld-chatgpt/","md":"https://postcutoff.com/e/2026-11-13-additive-cubes-avoidable-0123-jamet-rosenfeld-chatgpt/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-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":[{"n":1,"title":"arXiv 2611.17999: Additive cubes are avoidable over {0,1,2,3}, {0,1,4} and {0,2,5}","url":"https://arxiv.org/abs/2611.17999","type":"paper","group":"primary","domain":"arxiv.org"}],"official":1,"filed":"2026-11-16","updated":"2026-11-16","orgs":["OpenAI","Université de Lorraine","Université de la Polynésie française"],"title":"Additive cubes are avoidable over {0,1,2,3}: Jamet and Rosenfeld settle Pirillo and Varricchio's 1994 question, starting from a morphism suggested by ChatGPT","summary":"arXiv 2611.17999 (math.CO, 13 Nov 2026), Damien Jamet (LORIA) and Matthieu Rosenfeld (Université de la Polynésie française): additive cubes are avoidable over {0,1,2,3}, and also over {0,1,4} and {0,2,5}, 'solving a long-standing question initiated by Pirillo and Varricchio in 1994'. Extending the method of Cassaigne, Currie, Schaeffer and Shallit (2014), the check reduces to a finite graph traversal. ChatGPT suggested the first candidate morphism; the authors proved it and found seven more by search.","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"],"key_numbers":[],"tags":["math","combinatorics-on-words","additive-cubes","chatgpt","gpt-6","arxiv"],"science":{"field":"mathematics","subfield":"combinatorics on words","problem":"Avoidability of additive cubes over {0,1,2,3} (Pirillo–Varricchio 1994)","result":"Avoidable; also over {0,1,4} and {0,2,5}","open_since":"1994","ai_system":["ChatGPT (GPT-6)"],"human_role":"ChatGPT proposed the first candidate morphism; humans proved it and extended the search","verification":{"key":"preprint","label":"Preprint only","text":"Unrefereed preprint; computer-checked graph traversal"},"status":"pending","shock":""},"body_md":"## What happened\n\nJamet 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\nmorphism that ChatGPT proposed when Rosenfeld asked about the problem; the authors proved it works and found seven more.\n\n## Why it matters\n\nThe 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\nmodel supplying the key construction.","disputed":[{"label":"Verification","text":"Unrefereed preprint; computer-checked graph traversal","sources":[]}],"related":[{"id":"2026-11-16-ai-assisted-results-november-16-listing","url":"https://postcutoff.com/e/2026-11-16-ai-assisted-results-november-16-listing/","date":"2026-11-16","date_precision":"day","short_title":"AI-assisted results, 16 Nov","deck":null,"takeaway":"The sweep listed 260 arXiv papers with AI statements, 52 conjecture papers without one, 62 new Hexagon works and 16 result-repo commits. Every PDF was read at its AI statement. Eight results got their own entries; 54 arXiv papers and 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":10,"official":10,"filed":"2026-11-16","updated":"2026-11-16","orgs":["OpenAI","Anthropic","Google","various researchers"]}],"people":[],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-11-16","type":"filed","text":"Created (science agent)"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-11-16","run":null,"sources_read":null,"updated":"2026-11-16","human_review":null,"version":{"date":"2026-11-16"}},"gaps":[{"model_id":"gpt-6-2-astra","name":"GPT-6.2 Astra","cutoff":"2026-05","days_after":166,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":136,"in_training_data":false},{"model_id":"gemini-4-hydrogen","name":"Gemini 4 Hydrogen","cutoff":"2026-03","days_after":227,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":166,"in_training_data":false}],"short_url":null}