A simpler proof of the Boros-Füredi-Bárány-Pach-Gromov theorem

DOI10.1007/S00454-011-9332-1zbMATH Open1237.05054arXiv1012.5890OpenAlexW2067339112MaRDI QIDQ411397FDOQ411397

Roman Karasev

Publication date: 4 April 2012

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Abstract: A short and almost elementary proof of the Boros-F"uredi-B'ar'any-Pach-Gromov theorem on the multiplicity of covering by simplices in $mathbb{R}^d$ is given.

Full work available at URL: https://arxiv.org/abs/1012.5890

zbMATH Keywords

multiplicity of mapsimplicial depth

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Convex sets in (2) dimensions (including convex curves) (52A10)

Cites Work

• On a notion of data depth based on random simplices
• The number of triangles covering the center of an \(n\)-set
• A generalization of Caratheodory's theorem
• Singularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetry
• Overlap properties of geometric expanders
• The colored Tverberg's problem and complexes of injective functions
• A Tverberg-type result on multicolored simplices
• Optimal bounds for the colored Tverberg problem
• A Colored Version of Tverberg's Theorem

Cited In (24)

• On the chromatic number of generalized Kneser hypergraphs
• The filling problem in the cube
• On Laplacians of random complexes
• Ramanujan complexes and high dimensional expanders
• Helly-type theorems for the diameter
• On Gromov's method of selecting heavily covered points
• Title not available (Why is that?)
• A direct proof of Gromov's theorem
• Upper bounds for stabbing simplices by a line
• Extremal problems for pairs of triangles
• A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing
• Carathéodory's theorem in depth
• Bounds for Pach's selection theorem and for the minimum solid angle in a simplex
• Tverberg’s theorem is 50 years old: A survey
• On expansion and topological overlap
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
• Intersection theorems for triangles
• The intersection of a matroid and an oriented matroid
• An analogue of Gromov's waist theorem for coloring the cube
• A note on lower bounds for colourful simplicial depth
• A new lower bound based on Gromov's method of selecting heavily covered points
• Quantitative \((p, q)\) theorems in combinatorial geometry
• A slight improvement to the colored Bárány's theorem
• Positive-fraction intersection results and variations of weak epsilon-nets

This page was built for publication: A simpler proof of the Boros-Füredi-Bárány-Pach-Gromov theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q411397)