§1, paragraph on stochastic localization and (8); references [12], [22], [23], [28]
For isotropic log-concave measures, Lee and Vempala obtained C_P(μ) ≤ C√n (Ann. Math. 2024); Chen established a sub-polynomial bound (GAFA 2021); Klartag and Lehec proved a poly-logarithmic bound (GAFA 2022); and Klartag proved C_P(μ) ≤ C log n (2023).
Passage details
Passage ID: kls-conjecture:entry:bkl-history:v1
Source item: introduction-history
Source record: kls-conjecture:source:bkl:v1