{"id":"palomar/PALOMAR-2026-11-10-000010","url":"https://github.com/snow-ghost/lrx-lean/tree/9cffbfbab7e1d6f5be1012c3caf608478f5af5b6","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-10-000010-v1.json","repo":"https://github.com/snow-ghost/lrx-lean","tags":["math.CO","math.GR","msc:05C12","msc:05C25","msc:20B30"],"score":0,"title":"Exact LRX diameter of the symmetric group","trust":"high","domain":"math.CO","source":"palomar","authors":["S. Uskov","A. Chervov","F. Levkovich-Maslyuk","I. Litvak","A. Smolensky","A. Soibelman","Dia Taha"],"reviews":0,"subject":"math.CO","summary":"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.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-10","reactions":{},"formalized":true}