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

DOI10.1007/978-3-030-46762-3_2zbMATH Open1446.52006arXiv1810.06189OpenAlexW2897943774MaRDI QIDQ5115961FDOQ5115961

Authors: B. Klartag, Galyna V. Livshyts 

Publication date: 21 August 2020

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

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.

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

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

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)

Cites Work

• High-Dimensional Probability
• Title not available (Why is that?)
• On convex perturbations with a bounded isotropic constant
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Irregularities of distribution. I
• Coverings of random ellipsoids, and invertibility of matrices with i.i.d. heavy-tailed entries
• On High Dimensional Maximal Functions Associated to Convex Bodies
• A hyperplane inequality for measures of convex bodies in \(\mathbb R^{n }, \; n\leq 4\)
• Title not available (Why is that?)
• On delocalization of eigenvectors of random non-Hermitian matrices
• A \(\sqrt{n}\) estimate for measures of hyperplane sections of convex bodies
• Slicing inequalities for measures of convex bodies
• On some vector balancing problems
• A Remark on Measures of Sections of $$\boldsymbol{L}_{p}$$ -balls
• An example related to the slicing inequality for general measures
• A discrete version of Koldobsky's slicing inequality
• 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

Cited In (10)

• Polynomial bounds in Koldobsky's discrete slicing problem
• Comparison problems for Radon transforms
• Bounds on the lattice point enumerator via slices and projections
• Inequalities for the derivatives of the Radon transform on convex bodies
• Weighted Minkowski’s existence theorem and projection bodies
• On delocalization of eigenvectors of random non-Hermitian matrices
• 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)