Simplex slicing: an asymptotically-sharp lower bound

DOI10.1016/J.AIM.2024.109784zbMATH Open1546.52009MaRDI QIDQ6592201FDOQ6592201

Authors: Colin Tang 

Publication date: 24 August 2024

Published in: Advances in Mathematics (Search for Journal in Brave)

Recommendations

• Central slices of the regular simplex
• Lower bounds for the simplexity of the \(n\)-cube
• Sections of the regular simplex – Volume formulas and estimates
• scientific article; zbMATH DE number 1574595
• The Lower Bound for Koldobsky’s Slicing Inequality via Random Rounding

zbMATH Keywords

exponential distributionregular simplexminimal sectionvolume of sections

Mathematics Subject Classification ID

Geometry and structure of normed linear spaces (46B20) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Cites Work

• Cube Slicing in R n
• The volume of duals and sections of polytopes
• Gitterperiodische Punktmengen und Isoperimetrie
• Slicing the Cube in R n and Probability (Bounds for the Measure of a Central Cube Slice in R n by Probability Methods)
• Title not available (Why is that?)
• Hyperplane sections of convex bodies in isotropic position
• Sections of the regular simplex – Volume formulas and estimates
• Volume estimates for sections of certain convex bodies
• Title not available (Why is that?)
• Central slices of the regular simplex
• Non-central sections of the simplex, the cross-polytope and the cube
• A note on the extremal non-central sections of the cross-polytope
• A remark on the extremal non-central sections of the unit cube
• Extremal sections and projections of certain convex bodies: a survey

This page was built for publication: Simplex slicing: an asymptotically-sharp lower bound

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