Polynomial bounds in Koldobsky's discrete slicing problem

DOI10.1090/PROC/16753MaRDI QIDQ6554704zbMATH OpenFDO

Authors Ansgar Freyer, Martin Henk

Publication date 13 June 2024

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/PROC/16753

zbMATH Keywords

Koldobsky's discrete slicing problempolynomial bounds

Mathematics Subject Classification ID

Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Asymptotic theory of convex bodies (52A23) Inequalities and extremum problems involving convexity in convex geometry (52A40) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Recommendations

• A discrete version of Koldobsky's slicing inequality
• The Lower Bound for Koldobsky’s Slicing Inequality via Random Rounding
• A remark on the slicing problem
• scientific article; zbMATH DE number 1574595
• scientific article; zbMATH DE number 775020

Cites work

• A \(\sqrt{n}\) estimate for measures of hyperplane sections of convex bodies
• A discrete version of Koldobsky's slicing inequality
• An almost constant lower bound of the isoperimetric coefficient in the KLS conjecture
• Asymptotic geometric analysis. I
• Bounds on the lattice point enumerator via slices and projections
• Bourgain's slicing problem and KLS isoperimetry up to polylog
• Convex and Discrete Geometry
• Convex Bodies Associated with a Given Convex Body
• Convex Bodies The Brunn-MinkowskiTheory
• Estimates for measures of sections of convex bodies
• From the Mahler conjecture to Gauss linking integrals
• Geometric tomography
• Geometry of isotropic convex bodies
• scientific article; zbMATH DE number 4133027 (Why is no real title available?)
• scientific article; zbMATH DE number 3987367 (Why is no real title available?)
• scientific article; zbMATH DE number 4113273 (Why is no real title available?)
• scientific article; zbMATH DE number 4115281 (Why is no real title available?)
• scientific article; zbMATH DE number 3046578 (Why is no real title available?)
• Interpolating between volume and lattice point enumerator with successive minima
• Lattice-free simplices with lattice width \(2d - o(d)\)
• New volume ratio properties for convex symmetric bodies in \({\mathbb{R}}^ n\)
• On High Dimensional Maximal Functions Associated to Convex Bodies
• Packing minima and lattice points in convex bodies
• Partitions of mass-distributions and of convex bodies by hyperplanes
• Sections of convex bodies through their centroid
• Slicing inequalities for measures of convex bodies
• The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces
• The Lower Bound for Koldobsky’s Slicing Inequality via Random Rounding

Cited in

(3)

• Stability of polydisc slicing
• Lattice reduced and complete convex bodies
• On lattice diameter segments: algorithms and structure

This page was built for publication: Polynomial bounds in Koldobsky's discrete slicing problem

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