Regular Polygonal Partitions of a Tverberg Type
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 of regular polygons, and likewise to points in and the product polytopes . As with Tverberg's original theorem, our results admit topological generalizations when is a prime power, and, using the "constraint method" of Blagojevi\'c, Frick, and Ziegler, allow for dimensionally restricted versions of a van Kampen--Flores type and colored analogues in the fashion of Sober\'on.
Cite
@article{arxiv.1908.10810,
title = {Regular Polygonal Partitions of a Tverberg Type},
author = {Leah Leiner and Steven Simon},
journal= {arXiv preprint arXiv:1908.10810},
year = {2023}
}
Comments
15 pages, 3 figures. Typo in statements of Theorems 4.1(a) and 5.3(a) corrected. To appear in Discrete Comput Geom