English

Regular Polygonal Partitions of a Tverberg Type

Combinatorics 2023-11-10 v3 Algebraic Topology Metric Geometry

Abstract

A seminal theorem of Tverberg states that any set of T(r,d)=(r1)(d+1)+1T(r,d)=(r-1)(d+1)+1 points in Rd\mathbb{R}^d can be partitioned into rr subsets whose convex hulls have non-empty rr-fold intersection. Almost any collection of fewer points in Rd\mathbb{R}^d cannot be so divided, and in these cases we ask if the set can nonetheless be P(r,d)P(r,d)--partitioned, i.e., split into rr subsets so that there exist rr points, one from each resulting convex hull, which form the vertex set of a prescribed convex dd--polytope P(r,d)P(r,d). Our main theorem shows that this is the case for any generic T(r,2)2T(r,2)-2 points in the plane and any r3r\geq 3 when P(r,2)=PrP(r,2)=P_r is a regular rr--gon, and moreover that T(r,2)2T(r,2)-2 is tight. For higher dimensional polytopes and r=r1rkr=r_1\cdots r_k, ri3r_i \geq 3, this generalizes to T(r,2k)2kT(r,2k)-2k generic points in R2k\mathbb{R}^{2k} and orthogonal products P(r,2k)=Pr1××PrkP(r,2k)=P_{r_1}\times \cdots \times P_{r_k} of regular polygons, and likewise to T(2r,2k+1)(2k+1)T(2r,2k+1)-(2k+1) points in R2k+1\mathbb{R}^{2k+1} and the product polytopes P(2r,2k+1)=Pr1××Prk×P2P(2r,2k+1)=P_{r_1}\times \cdots \times P_{r_k} \times P_2. As with Tverberg's original theorem, our results admit topological generalizations when rr 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.

Keywords

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

R2 v1 2026-06-23T10:59:10.375Z