On Tverberg partitions
Abstract
A theorem of Tverberg from 1966 asserts that every set X⊂Rd of n=T(d,r)=(d+1)(r-1)+1 points can be partitioned into r pairwise disjoint subsets, whose convex hulls have a point in common. Thus every such partition induces an integer partition of n into r parts (that is, r integers a1,…,ar satisfying n=a1+·s+ar), where the parts ai correspond to the number of points in every subset. In this paper, we prove that for any partition ai d+1, i=1,…,r, there exists a set X⊂Rd of n points, such that every Tverberg partition of X induces the same partition on n, given by the parts a1,…,ar.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.