New Lower Bounds for Tverberg Partitions with Tolerance in the Plane

preprint2020arXivOpen access

Abstract

Let PP be a set nn points in a dd-dimensional space. Tverberg's theorem says that, if nn is at least (k−1)(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 k≥2k\ge 2 and t≥1t\ge 1.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.