REVIEW 8 cited by
The slicing conjecture via small ball estimates
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
The slicing conjecture via small ball estimates
read the original abstract
Bourgain's slicing conjecture was recently resolved by Joseph Lehec and Bo'az Klartag. We present an alternative proof by establishing small ball probability estimates for isotropic log-concave measures. Our approach relies on the stochastic localization process and Guan's bound, techniques also used by Klartag and Lehec. The link between small ball probabilities and the slicing conjecture was first observed by Dafnis and Paouris and is established through Milman's theory of M-ellipsoids.
Forward citations
Cited by 8 Pith papers
-
Optimal $MM^*$ bounds for convex bodies
For every isotropic convex body in R^n, the mean width M*(K) is O(sqrt(n log n)), and the product M(K)M*(K) is O(log n), both optimal up to constants.
-
The KLS constant is $O(\log^{1/4} n)$
Every isotropic log-concave measure satisfies a quadratic-form Poincaré inequality with constant 2, which implies the KLS constant is at most C log^{1/4} n.
-
Beyond the $d^{2.5}$-mixing bound for Dikin walks on polytopes
The Dikin walk with a scaled Lee-Sidford metric provably mixes on a polytope in O~(d^2.25) iterations from a warm start, improving the decade-old d^2.5 bound and taking a step toward the conjectured d^2.
-
Functional perimeter and the dimensional Brunn-Minkowski inequality for log-concave measures
Even log-concave measures satisfy μ(λK + (1-λ)L)^{c_n} ≥ λ μ(K)^{c_n} + (1-λ) μ(L)^{c_n} with c_n ≥ c/(n^3 ln n).
-
Banach-Mazur distances and basis constants of isotropic log-concave random spaces
Random normed spaces from isotropic log-concave measures satisfy d_BM >= cn / ln(1+m/n) with high probability, sharp in both parameters and recovering the order-n extremal when m is linear in n.
-
Minimum Norm Interpolation via the Local Theory of Banach Spaces: The Role of $2$-Uniform Convexity
Sharp bias and noise-error bounds for minimum-norm interpolators in 2-uniformly convex Banach spaces, with the first ℓ_p-MNI rates for non-Gaussian sub-Gaussian covariates.
-
Minimum Norm Interpolation via The Local Theory of Banach Spaces: The Role of Gaussianity
The sharp MSE bound for the ℓ1-minimum-norm interpolator under isotropic Gaussian covariates is recovered via the geometry of symmetric Gaussian polytopes, without the convex Gaussian min-max theorem.
-
Functional perimeter and the dimensional Brunn-Minkowski inequality for log-concave measures
Proves dimensional Brunn-Minkowski inequality for even log-concave measures with c_n ≥ c/(n^3 ln n) and shows Γ_n ≈ n for maximal functional perimeter of isotropic log-concave measures.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.