The Lower Bound for Koldobsky’s Slicing Inequality via Random Rounding

DOI10.1007/978-3-030-46762-3_2MaRDI QIDQ5115961zbMATH OpenOpenAlexFDO

Authors B. Klartag, Galyna V. Livshyts

Publication date 21 August 2020

Published in Lecture Notes in Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1810.06189

zbMATH Keywords

convex bodieslog-concave

Mathematics Subject Classification ID

Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Abstract: We study the lower bound for Koldobsky's slicing inequality. We show that there exists a measure $mu$ and a symmetric convex body $Ksubseteqmathbb{R}^n$, such that for all $xiin{S}^{n-1}$ and all $tinmathbbR,$ ${\displaystyle }$mu^+(Kcap(xi^{perp}+txi))leq frac{c}{sqrt{n}}mu(K)|K|^{-frac{1}{n}}.${\displaystyle }$ Our bound is optimal, up to the value of the universal constant. It improves slightly upon the results of the first named author and Koldobsky which included a doubly-logarithmic error. The proof is based on an efficient way of discretizing the unit sphere.

Recommendations

• A discrete version of Koldobsky's slicing inequality
• scientific article; zbMATH DE number 1775407
• Bourgain's slicing problem and KLS isoperimetry up to polylog
• An improved lower bound related to the Furstenberg-Sárközy theorem
• A lower bound for the discrepancy of a random point set
• On a generalization of iterated and randomized rounding
• The slice map problem and approximation properties
• scientific article; zbMATH DE number 903729
• Bounds on the coarseness of random sums
• scientific article; zbMATH DE number 1559524

Cites work

• scientific article; zbMATH DE number 177379 (Why is no real title available?)
• scientific article; zbMATH DE number 4115281 (Why is no real title available?)
• A \(\sqrt{n}\) estimate for measures of hyperplane sections of convex bodies
• A discrete version of Koldobsky's slicing inequality
• A hyperplane inequality for measures of convex bodies in \(\mathbb R^{n }, \; n\leq 4\)
• A remark on measures of sections of \(L_{p}\)-balls
• An example related to the slicing inequality for general measures
• Coverings of random ellipsoids, and invertibility of matrices with i.i.d. heavy-tailed entries
• Coverings: variations on a result of Rogers and on the epsilon-net theorem of Haussler and Welzl
• Estimates for moments of general measures on convex bodies
• High-dimensional probability. An introduction with applications in data science
• Irregularities of distribution. I
• On High Dimensional Maximal Functions Associated to Convex Bodies
• On convex perturbations with a bounded isotropic constant
• On delocalization of eigenvectors of random non-Hermitian matrices
• On some vector balancing problems
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Slicing inequalities for measures of convex bodies

Cited in

(11)

• Polynomial bounds in Koldobsky's discrete slicing problem
• Comparison problems for Radon transforms
• Bounds on the lattice point enumerator via slices and projections
• Simplex slicing: an asymptotically-sharp lower bound
• Inequalities for the derivatives of the Radon transform on convex bodies
• On delocalization of eigenvectors of random non-Hermitian matrices
• Weighted Minkowski’s existence theorem and projection bodies
• General measure extensions of projection bodies
• The smallest singular value of inhomogeneous square random matrices
• The smallest singular value of heavy-tailed not necessarily i.i.d. random matrices via random rounding
• Measure comparison and distance inequalities for convex bodies

This page was built for publication: The Lower Bound for Koldobsky’s Slicing Inequality via Random Rounding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5115961)