Logarithmic bounds for isoperimetry and slices of convex sets
Abstract
We prove that the Bourgain slicing conjecture and the Kannan-Lov\'asz-Simonovits (KLS) isoperimetric conjecture in Rn hold true up to a factor of n. A new ingredient used in the proof is an improved log-concave Lichnerowicz inequality.
0
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.