Sections of the regular simplex - Volume formulas and estimates
Hauke Dirksen

TL;DR
This paper derives a general volume formula for intersections of regular simplices with subspaces, analyzes maximal and minimal volume sections, and provides bounds for k-dimensional sections, advancing geometric understanding of simplices.
Contribution
It introduces a new general volume formula for simplex sections and extends known results on maximal and minimal hyperplane sections using a novel proof technique.
Findings
Maximal volume hyperplane sections contain n-1 vertices.
For small distances to the centroid, hyperplanes with n-1 vertices maximize volume.
Provides bounds for k-dimensional sections.
Abstract
We state a general formula to compute the volume of the intersection of the regular -simplex with some -dimensional subspace. It is known that for central hyperplanes the one through the centroid containing vertices gives the maximal volume. We show that, for fixed small distances of a hyperplane to the centroid, the hyperplane containing vertices is still volume maximizing. The proof also yields a new and short argument for the result on central sections. With the same technique we give a partial result for the minimal central hyperplane section. Finally, we obtain a bound for -dimensional sections.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPoint processes and geometric inequalities · Mathematics and Applications · Computational Geometry and Mesh Generation
