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
- SUFLECA shows NOC-based correspondence can improve CAD-to-image alignment — ducha_aiki · 2026-07-21
- OpenAI-style autonomous researchers could become real scientific collaborators — Promptmethus · 2026-07-21
- Soft Clamp cuts tool-call overuse in multi-teacher distillation, from 13.7% to 9.0% — antgroup · 2026-07-21
- ShotPlan adds learnable planning tokens for cinematic multi-shot video generation — Tele-AI · 2026-07-21
- A silicon photonic reservoir chip compensates fiber distortion in real time at 28 Gbps — bravo_abad · 2026-07-21
- A developer maps out six design rules for CLIs that humans and AI agents can both use — yujiezha · 2026-07-21