Proof of a Conjecture of Barany, Katchalski and Pach

被引:21
|
作者
Naszodi, Marton [1 ]
机构
[1] Eotvos Lorand Univ, ELTE, Dept Geometry, H-1117 Budapest, Hungary
关键词
Helly's theorem; Quantitative Helly theorem; Intersection of convex sets; Dvoretzky-Rogers lemma; John's ellipsoid; Volume;
D O I
10.1007/s00454-015-9753-3
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Barany, Katchalski and Pach (Proc Am Math Soc 86(1):109-114, 1982) (see also Barany 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 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 Barany et al. (Am Math Mon 91(6):362-365, 1984), the bound was proved and was conjectured. We confirm it.
引用
收藏
页码:243 / 248
页数:6
相关论文
共 50 条