Abstract
Let be a set points in a -dimensional space. Tverberg's theorem says that, if is at least , then can be partitioned into sets whose convex hulls intersect. Partitions with this property are called {\em Tverberg partitions}. A partition has tolerance if the partition remains a Tverberg partition after removal of any set of points from . Tolerant Tverberg partitions exist in any dimension provided that is sufficiently large. Let be the smallest value of such that tolerant Tverberg partitions exist for any set of points in . Only few exact values of are known. In this paper we establish a new tight bound for . We also prove many new lower bounds on for and .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.