Sharing pizza in n dimensions
Richard Ehrenborg, Sophie Morel, Margaret Readdy

TL;DR
This paper generalizes the Pizza Theorem to n-dimensional spaces using hyperplane arrangements, proving conditions under which the alternating sum of volumes or surface volumes of partitioned regions equals zero, especially for symmetric convex bodies.
Contribution
It introduces the n-dimensional Pizza Theorem for Coxeter arrangements, providing new conditions and formulas for volume and surface volume sums in high-dimensional symmetric settings.
Findings
The pizza quantity vanishes for certain symmetric convex bodies.
The pizza quantity is polynomial in translation vector for symmetric sets.
The theorem extends to surface volumes of n-dimensional balls under specific conditions.
Abstract
We introduce and prove the -dimensional Pizza Theorem: Let be a hyperplane arrangement in . If is a measurable set of finite volume, the {pizza quantity} of is the alternating sum of the volumes of the regions obtained by intersecting with the arrangement . We prove that if is a Coxeter arrangement different from such that the group of isometries generated by the reflections in the hyperplanes of contains the map , and if is a translate of a convex body that is stable under and contains the origin, then the pizza quantity of is equal to zero. Our main tool is an induction formula for the pizza quantity involving a subarrangement of the restricted arrangement on hyperplanes of that we call the {even restricted arrangement}. More generally, we prove…
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 · Advanced Combinatorial Mathematics · Computational Geometry and Mesh Generation
