论文信息 - A Simpler Proof of the Boros–Füredi–Bárány–Pach–Gromov Theorem - 字舞流文

A Simpler Proof of the Boros–Füredi–Bárány–Pach–Gromov Theorem

A short and almost elementary proof of the Boros–Füredi–Bárány–Pach–Gromov theorem on the multiplicity of covering by simplices in ℝd is given.

Roman N. Karasev | R. Karasev

[1] Imre Bárány,et al. A generalization of carathéodory's theorem , 1982, Discret. Math..

[2] Z. Füredi,et al. The number of triangles covering the center of an n-set , 1984 .

[3] I Barany,et al. A GENERALIZATION OF CARATHEODORYS THEOREM , 1982 .

[4] I. Bárány,et al. A Colored Version of Tverberg's Theorem , 1992 .

[5] M. Gromov. Singularities, Expanders and Topology of Maps. Part 2: from Combinatorics to Topology Via Algebraic Isoperimetry , 2010 .

[6] Sinisa T. Vrecica,et al. The Colored Tverberg's Problem and Complexes of Injective Functions , 1992, J. Comb. Theory A.

[7] János Pach,et al. Overlap properties of geometric expanders , 2011, SODA '11.

[8] Pavle V. M. Blagojevi'c,et al. Optimal bounds for the colored Tverberg problem , 2009, 0910.4987.

[9] Regina Y. Liu. On a Notion of Data Depth Based on Random Simplices , 1990 .

[10] János Pach. A Tverberg-type result on multicolored simplices , 1998, Comput. Geom..