Exact diameter of the symmetric group with LRX generators, n(n−1)/2 for every n ≥ 4
Seven authors report that their agentic system, mainly GPT-6 Astra, proved the undirected Cayley graph of generated by the cyclic shift, its inverse and the transposition of the first two positions has diameter for every , with a finite set of special cases checked by C++ code and the result registered on Palomar as a Lean proof.
- Lab
- Independent
- Model
- GPT-6 Astra (agentic system and Codex); Claude Opus 5.5 (minor checks and editing)
- Field
- Mathematics
- Date
- 2026-11-10
- Human collaborators
- Sergei Uskov, Alexander Chervov, Fedor Levkovich-Maslyuk, Ivan Litvak, Andrei Smolensky, Alexander Soibelman, Dia Taha
What was found
With the cyclic shift, and the transposition of the first two positions, the question is the largest distance between two permutations in the Cayley graph, OEIS A186783; the paper says the conjectured value was open since at least 2011, and the CayleyPy growth computations listed it among their conjectures. The paper establishes sharp upper and lower bounds by combinatorial and group-theoretic arguments, leaving a finite set of special cases verified by accompanying C++ code. The Palomar record proves the upper and lower bounds and constructs an explicit L, R, X word of at most that length between every ordered pair of permutations, against a Mathlib-only Challenge.
Novelty check
arXiv, 2026-11-19, abs:"symmetric group" AND abs:"Cayley graph" AND abs:diameter AND abs:transposition returned 5 records, including a 2020 upper bound for a related generator set and the CayleyPy papers that list this diameter as a conjecture; none proves it. Nothing in this registry covers Cayley graph diameters.
Caveats and known objections
Held at claimed on a conservative reading. Palomar records trust level high and a nanoda kernel check of PalomarLRX.exactDiameter and PalomarLRX.boundedRouting at a pinned commit, which for other entries in this registry has supported formal; the registration is by a third-party repository, snow-ghost/lrx-lean, whose relationship to the authors is not stated, and no human outside the group has audited its Challenge statement. The finite cases in the paper rest on C++ code, not on the Lean development, as far as the paper says. Hexagon labels the text a mix of human-written and AI-generated with human understanding of some parts: Section 1 is mostly human-written and the rest, including the proof, AI-generated with minor human edits. Autonomy is ai-led rather than autonomous: the authors describe human intervention as relatively minor and mostly workflow orchestration, and the problem was posed by humans.
Machine-checked elsewhere
PalomarExact LRX diameter of the symmetric group
PALOMAR-2026-11-10-000010 · snow-ghost/lrx-lean at 9cffbfbab7e1 · checked 2026-11-19
ProvedPalomarLRX.exactDiameterPalomarLRX.boundedRouting
A Lean proof that typechecks against the recorded statement at a pinned commit under a declared axiom set, checked mechanically rather than by human review. It does not certify that a result is new or of research interest: the only filter on that is a language-model screen, and Palomar states that it adds no human editorial step.
Trust level high; checked by the nanoda kernel.
Also recorded at
vibematheddiameter-of-the-symmetric-group-s-n-with-lrx-generators
Nothing mechanically. It is a parallel listing of the same result, carrying its own verification label rather than an independent check.
No independent check is recorded on this entry yet.
Reading the primary source closely enough to say whether it supports the claim counts as a check, and you are credited on the entry.
Or on GitHub: submit a check challenge the grade send a correction or send a pull request
Flag this for triage
Signals order the review queue and nothing else. They are never published, and they never move a grade: that takes a citation.
Entry history (1 event)
- AddedEntered the registry graded Claimed and AI-led.
Entries are never deleted. A grade that does not hold up is downgraded on the record, with the reason beside it.
Graded claimed for verification and ai-led for autonomy. What these mean.
Cite this entry
whataifound.org. (2026). Exact diameter of the symmetric group with LRX generators, n(n−1)/2 for every n ≥ 4. whataifound.org: A Registry of AI Scientific and Mathematical Discoveries. https://whataifound.org/finding/2026-11-10-lrx-diameter-symmetric-group
BibTeX
@misc{whataifound-independent-2026-group,
title = {Exact diameter of the symmetric group with LRX generators, n(n−1)/2 for every n ≥ 4},
author = {{whataifound.org}},
year = {2026},
howpublished = {whataifound.org: A Registry of AI Scientific and Mathematical Discoveries},
note = {Result by Independent. Verification: Claimed. Autonomy: AI-led.},
url = {https://whataifound.org/finding/2026-11-10-lrx-diameter-symmetric-group}
}