Regular Polygonal Partitions of a Tverberg Type
Leah Leiner, Steven Simon

TL;DR
This paper extends Tverberg's theorem by demonstrating that certain point sets in Euclidean space can be partitioned into subsets whose convex hulls intersect in a pattern matching regular polygons or their products, even with fewer points than the classical theorem requires.
Contribution
It introduces new partitioning results for point sets related to regular polygons and their products, generalizing Tverberg's theorem to these geometric configurations and establishing tight bounds.
Findings
Partitioning of points into subsets with convex hulls intersecting as regular polygons
Extension of Tverberg's theorem to polygonal and product polytopes
Topological and dimensionally restricted generalizations
Abstract
A seminal theorem of Tverberg states that any set of points in can be partitioned into subsets whose convex hulls have non-empty -fold intersection. Almost any collection of fewer points in cannot be so divided, and in these cases we ask if the set can nonetheless be --partitioned, i.e., split into subsets so that there exist points, one from each resulting convex hull, which form the vertex set of a prescribed convex --polytope . Our main theorem shows that this is the case for any generic points in the plane and any when is a regular --gon, and moreover that is tight. For higher dimensional polytopes and , , this generalizes to generic points in and orthogonal products $P(r,2k)=P_{r_1}\times…
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.
