Lehmer’s 1965 permutation conjecture proved
Claude Opus 5.5 found the short hypercube proof
Event confirmedAwaiting review
Importance: major (4 of 5)The 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.
Status
- Claim
Event confirmedAwaiting review
- Our reporting
- High confidence
- Verification
- Lean-verified
- Importance
- Major (4 of 5)
- Last verified
- 9 October 2026
Your AI and this story
- GPT-6.2 Astra123 days after its cutoff
- Claude Opus 5.593 days after its cutoff
- Gemini 4 Hydrogen184 days after its cutoff
- Grok 4.7123 days after its cutoff
None of these four assistants can know about it. The closest, Claude Opus 5.5, stops 93 days before it.
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
What happened
D. H. Lehmer conjectured in 1965 that the permutations of any multiset can be traversed by adjacent swaps, visiting every word, with some words visited twice. Knuth’s TAOCP lists it as an open research problem. In 2017 Verhoeff restated it as a Hamiltonicity question. Working with successive Claude models from March 2026, he first reached a very long proof. Then Claude Opus 5.5 proposed reading each word as a sequence of “dominoes”. In that view the even-position swaps generate hypercube orbits, and gluing their Gray cycles gives the Hamiltonian cycles. A multi-agent workflow developed this into the paper’s main theorems.
Why it matters
This is a famous, decades-old combinatorics problem named in Knuth’s TAOCP, and the paper credits the key proof idea directly to Claude Opus 5.5. It is also a clear before-and-after comparison: earlier models helped produce a long proof slowly, while the newer model found a short one quickly. The result is still an unrefereed preprint, so its status is pending.
What is disputed or not yet verified
| Verification | Lean formalization by Harmonic’s Aristotle (per the paper); unrefereed preprint |
|---|
Sources
3 sources from 3 sites. Numbers match the chips in the text.
3 sources: 1 primary, 2 press
Primary
- arXiv 2610.01240: A proof of Lehmer’s permutation conjecture for neighbor-swap graphsarxiv.org, paper
Press
Changes
- Added TU/e’s 8 Oct feature (autonomy quote, proof and Lean sizes, DeepSeek V4.1 Flash’s role) and IO+ syndication
- Filed from AI disclosure read in the PDF