scientific article; zbMATH DE number 1790523
The paper gives an overview of combinatorial results connected to Tverberg's theorem (every subset of at least \((m-1)(d+1)+1\) points of \(\mathbb{R}^d\) has a partition into \(m\) subsets with intersecting convex hulls), gives hints of an `elementary' proof of it, and terminates in the open question of existence of a purely combinatorial proof. Recent results of the author are mentioned for \(d=3,4\), which partially solve Reay's conjectured extension of Tverberg: every subset of at least \((m-1)(d+1)+k+1\) points of \(\mathbb{R}^d\) has a partition into \(m\) subsets with convex hulls intersection of dimension at least \(k\). For the entire collection see [Zbl 0966.00021].
- Tverberg-type theorems for pseudoconfigurations of points in the plane
- The partition conjecture
- On Reay's relaxed Tverberg conjecture and generalizations of Conway's thrackle conjecture
- Tverberg's theorem via number fields
- Strong independence and the dimension of a Tverberg set
- Tverberg-type theorems for matroids: a counterexample and a proof
- Quantitative Tverberg theorems over lattices and other discrete sets
- Tverberg-type theorems with altered intersection patterns (nerves)
- Tverberg’s theorem is 50 years old: A survey
- Tverberg theorems over discrete sets of points
- Some variations on Tverberg's theorem
- Partitions of points into simplices with k-dimensional intersection. I: The conic Tverberg's theorem
- A partition theorem of Tverberg-type for boxes in R^3
- Tverberg-type theorems for intersecting by rays
- A Tverberg type theorem for staircase convexity
- Tame combing and almost convexity conditions.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4549609)
