Theorems of Carath'eodory, Helly, and Tverberg without dimension
Not on the map. Why?
Abstract (arXiv)
We prove a no-dimensional version of Carath'edory's theorem: given an n-element set Psubset Red, a point a ∈ conv P, and an integer r≤ d, r ≤ n, there is a subset Qsubset P of r elements such that the distance between a and conv Q is less than diam P/√ 2r. A general no-dimension Helly type result is also proved with colourful and fractional consequences. Similar versions of Tverberg's theorem and some of their extensions are also established.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 22 Jun 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 2; 2025: 0; 2026: 2.
4 papers.
- 2024Towards the mathematical foundation of the minimum enclosing ball and related problemscited by 1
- 2026Hardness of High-Dimensional Linear Classificationcited by 1
- 2024Towards the methodology for solving the minimum enclosing ball and related problemscited by 0
- 2026The VC dimension of partial concept classes via Radon's theoremcited by 0
- 2026The VC dimension of partial concept classes via Radon's theorem12 Jul 2026
- 2026Hardness of High-Dimensional Linear Classification19 Mar 2026
- 2024Towards the methodology for solving the minimum enclosing ball and related problems14 Oct 2024
- 2024Towards the mathematical foundation of the minimum enclosing ball and related problems9 Jan 2024