Logarithmic bounds for isoperimetry and slices of convex sets

Abstract

We prove that the Bourgain slicing conjecture and the Kannan-Lovász-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.

17 pages. Ars Inveniendi Analytica publishes this version of the paper

Cited by in corpus (5)

• $L^p$-Minkowski Problem under Curvature Pinching
• Isotropic constants and regular polytopes
• Minkowski's successive minima in convex and discrete geometry
• On cutoff via rigidity for high dimensional curved diffusions
• An entropic approach for Hamiltonian Monte Carlo: the idealized case