Bourgain's slicing problem and KLS isoperimetry up to polylog
Bo'az Klartag, Joseph Lehec

TL;DR
This paper demonstrates that Bourgain's slicing problem and the KLS isoperimetric conjecture are valid up to polylogarithmic factors in high dimensions, advancing understanding in geometric functional analysis.
Contribution
The authors prove that both conjectures hold true up to polylogarithmic factors, providing significant progress in high-dimensional convex geometry.
Findings
Bourgain's slicing problem is confirmed up to polylogarithmic factors.
KLS isoperimetric conjecture is validated up to polylogarithmic factors.
The results improve bounds in high-dimensional convex geometry.
Abstract
We prove that Bourgain's hyperplane conjecture and the Kannan-Lov\'asz-Simonovits (KLS) isoperimetric conjecture hold true up to a factor that is polylogarithmic in the dimension.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Bourgain’s Slicing Problem and KLS Isoperimetry up to Polylog· youtube
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Advanced Mathematical Identities · Algebraic Geometry and Number Theory
