New Lower Bounds for Tverberg Partitions with Tolerance in the Plane
Combinatorics
2020-02-25 v1
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 .
Cite
@article{arxiv.2002.09660,
title = {New Lower Bounds for Tverberg Partitions with Tolerance in the Plane},
author = {Sergey Bereg and Mohammadreza Haghpanah},
journal= {arXiv preprint arXiv:2002.09660},
year = {2020}
}
Comments
10 figures