{"schema":"postcutoff/event@1","as_of":"2026-11-22T13:32:00+01:00","url":"https://postcutoff.com/e/2026-10-01-lehmer-permutation-conjecture-opus-5-5/","md":"https://postcutoff.com/e/2026-10-01-lehmer-permutation-conjecture-opus-5-5/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-10-01-lehmer-permutation-conjecture-opus-5-5","date":"2026-10-01","date_precision":"day","short_title":"Lehmer's 1965 permutation conjecture proved","deck":"Claude Opus 5.5 found the short hypercube proof","takeaway":"On Oct 1, 2026 Tom Verhoeff posted a proof of D. H. Lehmer's 1965 conjecture that the permutations of every multiset admit an imperfect Hamiltonian traversal by adjacent swaps.","category":"science","category_label":"Science & math","importance":4,"confidence":"high","status":{"key":"pending","labels":["Event confirmed","Awaiting review"]},"sources":[{"n":1,"title":"arXiv 2610.01240: A proof of Lehmer's permutation conjecture for neighbor-swap graphs","url":"https://arxiv.org/abs/2610.01240","type":"paper","group":"primary","domain":"arxiv.org"},{"n":2,"title":"TU/e: This mathematician worked on one problem for years and watched AI grow from assistant to grandmaster (8 Oct)","url":"https://www.tue.nl/en/news-and-events/news-overview/08-10-2026-this-mathematician-worked-on-one-problem-for-years-and-watched-ai-grow-from-assistant-to-grandmaster","type":"press","group":"press","domain":"tue.nl"},{"n":3,"title":"IO+: How a mathematician watched AI grow from servant to grandmaster","url":"https://ioplus.nl/en/posts/how-a-mathematician-watched-ai-grow-from-servant-to-grandmaster","type":"press","group":"press","domain":"ioplus.nl"}],"official":1,"filed":"2026-10-02","updated":"2026-10-09","orgs":["Eindhoven University of Technology","Anthropic","Harmonic"],"title":"Lehmer's 1965 permutation conjecture (a research problem in Knuth's TAOCP) proved; Claude Opus 5.5 found the short hypercube proof","summary":"On Oct 1, 2026 Tom Verhoeff posted a proof of D. H. Lehmer's 1965 conjecture that the permutations of every multiset admit an imperfect Hamiltonian traversal by adjacent swaps. Knuth's The Art of Computer Programming lists the question as an unsolved research problem. After about six months of work with earlier Claude models had produced a proof of nearly 200 pages, Claude Opus 5.5 found a short proof \"within a couple of hours\", built on a partition of the words into hypercubes. Harmonic's Aristotle produced the Lean formalization.","key_facts":["arXiv 2610.01240 (math.CO), Tom Verhoeff, 'A proof of Lehmer's permutation conjecture for neighbor-swap graphs', Oct 1, 2026","Result: proves Verhoeff's 2017 reformulation, Hamiltonicity of the graph N(S) on non-stutter words, with two exceptional families that have only Hamiltonian paths. This implies Lehmer's conjecture","AI role (paper): 'In that study phase, Claude Opus 5.5 proposed the representation that became the partition into hypercubes … It then developed this lead into the two theorems above, in successive multi-agent rounds: writing, independent recomputation of every construction, adversarial red-teaming, and hand refereeing'","Acknowledgments: 'I worked with various Claude models — Opus 4.7, Opus 4.8, Fable 5 (and Fable 5.1), and Opus 5 — but progress was slow; after some six months the proof (then almost 200 pages of dense mathematics) and its Lean formalization (more than one hundred thousand lines) came together. Then Opus 5.5 appeared, and Anton asked it to come up with a simple proof from scratch, which it did within a couple of hours.'","'The hypercube proof at the heart of this article was found and developed by Claude Opus 5.5 in a multi-agent proof effort.' Harmonic's Aristotle produced the Lean formalization","The problem was restarted after Anton Bakker's March 2026 challenge, made when Opus 4.7 came out: 'Software is done, and I bet mathematics as well'","TU/e news feature (8 Oct): Verhoeff, now retired from TU/e, says 'The long proof emerged in close collaboration with me, the shorter proof was produced autonomously.' The long proof (~150 pages per TU/e; the paper's acknowledgments say almost 200) needed 100,000+ lines of Lean, the short (<30-page) proof about 35,000. DeepSeek V4.1 Flash turned proof steps into programs for computational checks"],"key_numbers":[],"tags":["math","combinatorics","gray-codes","hamiltonian-cycles","knuth","claude-opus-5-5","lean","aristotle"],"science":{"field":"mathematics","subfield":"combinatorics (Gray codes, Hamiltonian cycles in Cayley-type graphs)","problem":"Lehmer's permutation conjecture (1965): imperfect Hamiltonian traversals of multiset permutations by adjacent swaps; an unsolved research problem in Knuth's TAOCP","result":"Proof of Verhoeff's reformulation (Hamiltonicity of the non-stutter-word graph N(S), with two exceptional families), and hence of Lehmer's conjecture.","open_since":"1965","ai_system":["Claude Opus 5.5","Aristotle"],"human_role":"Human-led long project; the final short proof was found and developed by Claude Opus 5.5 in a multi-agent setup, then re-derived and checked by the author","verification":{"key":"lean","label":"Lean-verified","text":"Lean formalization by Harmonic's Aristotle (per the paper); unrefereed preprint"},"status":"pending","shock":"Six months of work with earlier models gave a ~200-page proof; Opus 5.5 found a short one from scratch in a couple of hours."},"body_md":"## What happened\n\nD. H. Lehmer conjectured in 1965 that the permutations of any multiset can be traversed by adjacent swaps, visiting every word,\nwith some words visited twice. Knuth's TAOCP lists it as an open research problem. In 2017 Verhoeff restated it as a\nHamiltonicity question. Working with successive Claude models from March 2026, he first reached a very long proof. Then Claude\nOpus 5.5 proposed reading each word as a sequence of \"dominoes\". In that view the even-position swaps generate hypercube orbits,\nand gluing their Gray cycles gives the Hamiltonian cycles. A multi-agent workflow developed this into the paper's main theorems.\n\n## Why it matters\n\nThis is a famous, decades-old combinatorics problem named in Knuth's TAOCP, and the paper credits the key proof idea directly to\nClaude Opus 5.5. It is also a clear before-and-after comparison: earlier models helped produce a long proof slowly, while the\nnewer model found a short one quickly. The result is still an unrefereed preprint, so its status is pending.","disputed":[{"label":"Verification","text":"Lean formalization by Harmonic's Aristotle (per the paper); unrefereed preprint","sources":[]}],"related":[{"id":"2026-09-30-ai-assisted-conjecture-wave-summer-2026","url":"https://postcutoff.com/e/2026-09-30-ai-assisted-conjecture-wave-summer-2026/","date":"2026-09-30","date_precision":"day","short_title":"Summer 2026 flood: dozens of named conjectures settled on arXiv with disclosed AI help","deck":null,"takeaway":"This entry catalogues about 50 of them, with the AI role as the authors state it.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":11,"official":5,"filed":"2026-09-30","updated":"2026-10-19","orgs":["OpenAI","Anthropic","Google DeepMind","various mathematicians"]},{"id":"2026-02-28-knuth-claudes-cycles","url":"https://postcutoff.com/e/2026-02-28-knuth-claudes-cycles/","date":"2026-02-28","date_precision":"day","short_title":"Claude Opus 4.6 solves an open Hamiltonian-cycle problem, Donald Knuth reports","deck":null,"takeaway":"Coming from one of computing's most respected and AI-sceptical elders, the note became a cultural marker that frontier LLMs could contribute original mathematical constructions.","category":"science","category_label":"Science & math","importance":4,"confidence":"high","status":{"key":"confirmed","labels":["Result confirmed"]},"sources":3,"official":2,"filed":"2026-09-29","updated":"2026-09-29","orgs":["Anthropic","Stanford University"]}],"people":[],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-10-09","type":"edit","text":"Added TU/e's 8 Oct feature (autonomy quote, proof and Lean sizes, DeepSeek V4.1 Flash's role) and IO+ syndication"},{"date":"2026-10-02","type":"filed","text":"Created from AI disclosure read in the PDF"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-10-02","run":null,"sources_read":"AI disclosure read in the PDF","updated":"2026-10-09","human_review":null,"version":{"date":"2026-10-09"}},"gaps":[{"model_id":"gpt-6-2-astra","name":"GPT-6.2 Astra","cutoff":"2026-05","days_after":123,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":93,"in_training_data":false},{"model_id":"gemini-4-hydrogen","name":"Gemini 4 Hydrogen","cutoff":"2026-03","days_after":184,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":123,"in_training_data":false}],"short_url":"https://postcutoff.com/s/lehmer-1965-permutation"}