2000 character limit reached
Logarithmic bounds for isoperimetry and slices of convex sets
Published 27 Mar 2023 in math.FA, math.MG, and math.PR | (2303.14938v2)
Abstract: We prove that the Bourgain slicing conjecture and the Kannan-Lov\'asz-Simonovits (KLS) isoperimetric conjecture in $\mathbb{R}n$ hold true up to a factor of $\sqrt{\log n}$. A new ingredient used in the proof is an improved log-concave Lichnerowicz inequality.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.