Optimal Constant Problem for n-cycle Solved
michaelchchoi · x · 2026-07-15
The author, collaborating with Rupert Frank, published a new paper solving the problem of the optimal constant in the log-Sobolev inequality on the n-cycle.
The core conclusion states that for all n ≥ 4, this optimal constant equals half of the spectral gap. The text also reviews the history of this problem:
- The issue originally dates back to Diaconis–Saloff-Coste (1995)
- Even n=2k was solved by Chen–Sheu (2003)
- n=5 was solved by Chen–Liu–Saloff-Coste (2008)
- Odd n ≤ 21 were previously covered by computer-assisted proofs from Faust–Fawzi (2021)
- n=3 remains an exceptional case
More from Research
- LoMa Paper Ships REALLY HardPairs Dataset, Accepted at ECCV 2026 — ducha_aiki · 2026-09-11
- Johns Hopkins Launches Full-Stack Hands-on Robot Learning Class with SO-101 Arm Kits — _krishna_murthy · 2026-09-11
- SyncWorld: In-Context Robot World Model Simulates Unseen Views and Embodiments Zero-Shot — ChongZzZhang · 2026-09-11
- A 3D Pose Dataset for Dogs Released — ducha_aiki · 2026-09-11
- Five tells that still make AI video read as AI, from physics glitches to missing operators — NewPhoneWhotiz · 2026-09-11
- AnyMatch accepted to ECCV 2026 with a NoPresenter design — ducha_aiki · 2026-09-11