Abstract
Bárány, Katchalski and Pach (Proc Am Math Soc 86(1):109–114, 1982) (see also Bárány et al., Am Math Mon 91(6):362–365, 1984) 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). In Bárány et al. (Am Math Mon 91(6):362–365, 1984), the bound \(v(d)\le d^{2d^2}\) was proved and \(v(d)\le d^{cd}\) was conjectured. We confirm it.
Similar content being viewed by others
References
Ball, K.: An elementary introduction to modern convex geometry. Flavors of Geometry, pp. 1–58. Cambridge University Press, Cambridge (1997)
Bárány, I., Katchalski, M., Pach, J.: Quantitative Helly-type theorems. Proc. Am. Math. Soc. 86(1), 109–114 (1982)
Bárány, I., Katchalski, M., Pach, J.: Helly’s theorem with volumes. Am. Math. Mon. 91(6), 362–365 (1984)
Brazitikos, S., Giannopoulos, A., Valettas, P., Vritsiou, B.-H.: Geometry of Isotropic Convex Bodies, Mathematical Surveys and Monographs, vol. 196. American Mathematical Society, Providence, RI (2014)
De Loera, J.A., La Haye, R.N., Rolnick, D., Soberón, P.: Quantitative Tverberg, Helly, & Carathéodory Theorems. http://arxiv.org/abs/1503.06116 [math] (March 2015)
Dvoretzky, A., Rogers, C.A.: Absolute and unconditional convergence in normed linear spaces. Proc. Natl Acad. Sci. USA 36, 192–197 (1950)
Gordon, Y., Litvak, A.E., Meyer, M., Pajor, A.: John’s decomposition in the general case and applications. J. Differ. Geom. 68(1), 99–119 (2004)
John, F.: Extremum problems with inequalities as subsidiary conditions. Studies and Essays Presented to R. Courant on his 60th Birthday, pp. 187–204, 8 Jan 1948
Pivovarov, P.: On determinants and the volume of random polytopes in isotropic convex bodies. Geom. Dedicata 149, 45–58 (2010)
Acknowledgments
I am grateful for János Pach for the many conversations that we had on the subject and for the inspiring atmosphere that he creates in his DCG group at EPFL. I also thank the referee for helping to make the presentation more clear. The support of the János Bolyai Research Scholarship of the Hungarian Academy of Sciences, and the Hung. Nat. Sci. Found. (OTKA) Grant PD104744 is acknowledged.
Author information
Authors and Affiliations
Corresponding author
Additional information
Editor in Charge: János Pach
Rights and permissions
About this article
Cite this article
Naszódi, M. Proof of a Conjecture of Bárány, Katchalski and Pach. Discrete Comput Geom 55, 243–248 (2016). https://doi.org/10.1007/s00454-015-9753-3
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-015-9753-3
Keywords
- Helly’s theorem
- Quantitative Helly theorem
- Intersection of convex sets
- Dvoretzky–Rogers lemma
- John’s ellipsoid
- Volume