English

New Lower Bounds for Tverberg Partitions with Tolerance in the Plane

Combinatorics 2020-02-25 v1

Abstract

Let PP be a set nn points in a dd-dimensional space. Tverberg's theorem says that, if nn is at least (k1)(d+1)+1(k-1)(d+1)+1, then PP can be partitioned into kk sets whose convex hulls intersect. Partitions with this property are called {\em Tverberg partitions}. A partition has tolerance tt if the partition remains a Tverberg partition after removal of any set of tt points from PP. Tolerant Tverberg partitions exist in any dimension provided that nn is sufficiently large. Let N(d,k,t)N(d,k,t) be the smallest value of nn such that tolerant Tverberg partitions exist for any set of nn points in Rd\mathbb{R}^d. Only few exact values of N(d,k,t)N(d,k,t) are known. In this paper we establish a new tight bound for N(2,2,2)N(2,2,2). We also prove many new lower bounds on N(2,k,t)N(2,k,t) for k2k\ge 2 and t1t\ge 1.

Keywords

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