Hyperplane Equipartitions Plus Constraints
Steven Simon

TL;DR
This paper develops a constraint method to improve hyperplane equipartition results in geometric combinatorics, achieving optimal bounds and exact values for constrained cases, including orthogonality and cascades, beyond traditional bounds.
Contribution
It introduces a novel constraint method that extends equivariant techniques to obtain optimal and exact hyperplane equipartition results under various constraints.
Findings
Achieves exact values for orthogonal hyperplane equipartitions.
Provides bounds below the classical dimension $oldsymbol{ extit{ ext{Delta}}}(m+1;k)$.
Extends equipartition results to constrained scenarios like cascades and prescribed conditions.
Abstract
While equivariant methods have seen many fruitful applications in geometric combinatorics, their inability to answer the now settled Topological Tverberg Conjecture has made apparent the need to move beyond the use of Borsuk--Ulam type theorems alone. This impression holds as well for one of the most famous problems in the field, dating back to 1960, which seeks the minimum dimension such that any mass distributions in can be simultaneously equipartitioned by hyperplanes. Precise values of have been obtained in few cases, and the best-known general upper bound typically far exceeds the conjectured-tight lower bound arising from degrees of freedom. Following the "constraint method" of Blagojevi\'c, Frick, and Ziegler originally used for Tverberg-type results and recently to the present problem, we show how the imposition of…
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.
