Papers
Topics
Authors
Recent
Search
2000 character limit reached

On Tverberg partitions

Published 28 Aug 2015 in math.CO | (1508.07262v2)

Abstract: A theorem of Tverberg from 1966 asserts that every set $X\subset\mathbb{R}d$ 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 $a_1,\ldots,a_r$ satisfying $n=a_1+\cdots+a_r$), where the parts $a_i$ correspond to the number of points in every subset. In this paper, we prove that for any partition $a_i\le d+1$, $i=1,\ldots,r$, there exists a set $X\subset\mathbb{R}d$ of $n$ points, such that every Tverberg partition of $X$ induces the same partition on $n$, given by the parts $a_1,\ldots,a_r$.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.