English

On Tverberg partitions

Combinatorics 2017-05-17 v2

Abstract

A theorem of Tverberg from 1966 asserts that every set XRdX\subset\mathbb{R}^d of n=T(d,r)=(d+1)(r1)+1n=T(d,r)=(d+1)(r-1)+1 points can be partitioned into rr pairwise disjoint subsets, whose convex hulls have a point in common. Thus every such partition induces an integer partition of nn into rr parts (that is, rr integers a1,,ara_1,\ldots,a_r satisfying n=a1++arn=a_1+\cdots+a_r), where the parts aia_i correspond to the number of points in every subset. In this paper, we prove that for any partition aid+1a_i\le d+1, i=1,,ri=1,\ldots,r, there exists a set XRdX\subset\mathbb{R}^d of nn points, such that every Tverberg partition of XX induces the same partition on nn, given by the parts a1,,ara_1,\ldots,a_r.

Keywords

Cite

@article{arxiv.1508.07262,
  title  = {On Tverberg partitions},
  author = {Moshe White},
  journal= {arXiv preprint arXiv:1508.07262},
  year   = {2017}
}

Comments

4 pages, final version

R2 v1 2026-06-22T10:43:52.100Z