Proof of a conjecture of B\'ar\'any, Katchalski and Pach
classification
🧮 math.MG
keywords
intersectionkatchalskipachprovedsomevolumeboundconfirm
read the original abstract
B\'ar\'any, Katchalski and Pach proved the following quantitative form of Helly's theorem. If the intersection of a family of convex sets in $\mathbb{R}^d$ is of volume one, then the intersection of some subfamily of at most $2d$ members is of volume at most some constant $v(d)$. They proved the bound $v(d)\leq d^{2d^2}$, and conjectured $v(d)\leq d^{cd}$. We confirm it.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.