Scribd
Upload
20 views

Tverberg's Theorem Is 50 Years Old: A Survey: Imre B Ar Any Pablo Sober On

This survey provides an overview of advances in Tverberg's theorem over the last two decades. Tverberg's theorem from 1966 states that given (r-1)(d+1)+1 points in Rd, there exists a partition into r parts whose convex hulls intersect. The survey discusses topological, linear algebraic, and combinatorial aspects and applications of the theorem. It also presents several open problems and conjectures around variations and extensions of Tverberg's theorem.

Uploaded by

Zygmund Bauman
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
20 views

Tverberg's Theorem Is 50 Years Old: A Survey: Imre B Ar Any Pablo Sober On

This survey provides an overview of advances in Tverberg's theorem over the last two decades. Tverberg's theorem from 1966 states that given (r-1)(d+1)+1 points in Rd, there exists a partition into r parts whose convex hulls intersect. The survey discusses topological, linear algebraic, and combinatorial aspects and applications of the theorem. It also presents several open problems and conjectures around variations and extensions of Tverberg's theorem.

Uploaded by

Zygmund Bauman
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Tverberg’s theorem is 50 years old: a survey

Imre Bárány Pablo Soberón

Abstract
This survey presents an overview of the advances around Tverberg’s theorem, focusing on the
last two decades. We discuss the topological, linear-algebraic, and combinatorial aspects of Tver-
berg’s theorem and its applications. The survey contains several open problems and conjectures.

1 Introduction
Tverberg’s theorem has been a cornerstone of combinatorial convexity for over fifty years. Its impact
and influence is only comparable to that of the famous and classic theorems of Carathéodory and
Helly. This gem lies at the crossroads of combinatorics, topology, and linear algebra, and continues
to yield challenging and interesting open problems. Its states the following.

Theorem 1 (Helge Tverberg 1966 [?]). Given (r − 1)(d + 1) + 1 points in Rd , there is a partition of
them into r parts whose convex hulls intersect.

More formally, given X ⊂ Rd of (r − 1)(d + 1) + 1 points, there is a partition X = X1 ∪ · · · ∪ Xr


such that rj=1 conv Xj 6= ∅. Such a partition is called a Tverberg partition. The number of points
T

in this result is optimal, as a dimension-counting argument shows. In fact, if X is in general enough


position and in the partition X = X1 ∪ . . . ∪ Xr we have 1 ≤ |Xj | ≤ d + 1 for every j, then rj=1 aff Xj
T

is a single point if |X| = (r − 1)(d + 1) + 1, and is empty if |X| ≤ (r − 1)(d + 1).


The last decade has seen an impressive sequence of results around Tverberg’s theorem. The
purpose of this survey is to give a broad overview of the current state of the field and point out
key open problems. Other surveys covering different aspects of Tverberg’s theorem can be found in
[?, ?, ?, ?, ?, ?].
The paper is organized as follows. In sections 2 and 3 we describe the topological and colorful
versions of Tverberg’s theorem, which have received the most attention in recent years. In sections 4
and 5 we discuss a large number of variations and conjectures around Tverberg’s theorem. In Section
6 we describe some applications of Tverberg’s theorem. Finally, in Section 7 we present Tverberg-
type results where the settings have changed dramatically, such as Tverberg for convexity spaces or
quantitative versions. In that last section, we focus mostly on results which are related to geometry.

Figure 1: An example of a Tverberg partition. The partition is not unique.

1
1.1 Interlude: a short history of Tverberg’s theorem
An early predecessor of Tverberg’s theorem is Radon’s lemma from 1921 [?, ?]. Radon used it in
his proof of Helly’s theorem. It says that any set X of d + 2 points in Rd can be split into two sets
whose convex hulls intersect. So it is the case r = 2 of Tverberg’s theorem. Its proof is simple: the
P P
d + 2 vectors in X have a nontrivial affine dependence x∈X α(x)x = 0 and x∈X α(x) = 0. The
sets X1 = {x ∈ X : α(x) ≥ 0} and X2 = {x ∈ X : α(x) < 0} form a partition of X and their convex
hulls intersect, as one can easily check.
Another result linked to this theorem is Rado’s centerpoint theorem. This states that for any set
X of ln points d
m in R , there is a point p such that any closed half-space that contains p also contains at
n
least d+1 points of X. The standard proof of this result uses Helly’s theorem. Tverberg’s theorem
l m
n
implies it in few lines: setting r = d+1 , there is a partition of X into r parts X1 , . . . , Xr and a point
r
p ∈ Rd such that p ∈ j=1 conv Xj . Then p is a centerpoint of X: every closed halfspace containing
T

p contains at least one point from each Xj .


In a paper entitled “On 3N points in a plane” Birch [?] proves that any 3N points in the plane
determine N triangles that have a point in common. His motivation was the (planar) centerpoint
theorem. Actually, he proves more, namely the case d = 2 of Tverberg’s theorem and states the
general case as a conjecture.
Tverberg’s original motivation was also the centerpoint theorem and he learned about Birch’s
result and conjecture only later. He proved it first for d = 3 in 1963, and in full generality in 1964.
Here is, in his own words, how he found the proof: “I recall that the weather was bitterly cold in
Manchester. I awoke very early one morning shivering, as the electric heater in the hotel room had
gone off, and I did not have an extra shilling to feed the meter. So, instead of falling back to sleep, I
reviewed the problem once more, and then the solution dawned on me!” [?].

2 Topological versions

3 Colorful versions

4 The structure of Tverberg partitions

5 Universal Tverberg partitions

6 Applications of Tverberg’s theorem

7 Tverberg-type results in distinct settings

You might also like