Sharp log-Sobolev inequalities on finite cyclic groups
Abstract
Let Zn be the cyclic group equipped with the uniform probability measure π, and let Aψn be the Laplacian with word length \[ ψn(k) = (k,n-k). \] We prove the sharp log-Sobolev inequality \[ Entπ(f2) 2π(f Aψn f), f: Zn [0,∞), \] for every n 4. The proof is inspired by the recent work of Frank and Ivanisvili~FrankIvanisvili2026 on a sharp log-Sobolev inequality for nearest-neighbor simple random walk. We use their cubic-majorant reduction, which turns the problem into a 3rd moment estimate; the new point is a blockwise 3rd moment estimate adapted to the word-length multiplier. The same 3rd moment argument also recovers the log-Sobolev inequality for Poisson-semigroup on the circle, first proved by Weissler~Weissler1980. The same sharp inequalities were also obtained recently by Yao~Yao2026 by a different method.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.