Exact LRX diameter of the symmetric group
Source: github.com/snow-ghost/lrx-lean/tree/9cffbfbab7e1d6f5be1012c…
For every n >= 4 the Cayley graph of S_n with unit-cost generators L = (0 1 ... n-1), R = L inverse, and X = (0 1) has diameter n*(n-1)/2. The formalization proves upper and lower bounds and a literal L/R/X word of at most that length between every ordered pair of permutations. The independent Challenge defines the moves, their word evaluation, and the undirected Cayley graph using Mathlib alone.
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-10-000010
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-10-000010/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-10-000010/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'