On Gromov's method of selecting heavily covered points

DOI10.1007/S00454-014-9584-7zbMATH Open1298.51027OpenAlexW1863203090MaRDI QIDQ742816FDOQ742816

Authors: Uli Wagner, Jiří Matoušek 

Publication date: 19 September 2014

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

Full work available at URL: https://doi.org/10.1007/s00454-014-9584-7

Recommendations

• A new lower bound based on Gromov's method of selecting heavily covered points
• scientific article; zbMATH DE number 1305394
• Hitting simplices with points in \(\mathbb R^{3}\)
• Stabbing simplices by points and flats
• Selecting Heavily Covered Points

zbMATH Keywords

selection theoremscofilling profileshigher-dimensional expandersmultiplicities of maps

Mathematics Subject Classification ID

Polyhedra and polytopes; regular figures, division of spaces (51M20)

Cites Work

• The number of triangles covering the center of an \(n\)-set
• A generalization of Caratheodory's theorem
• Homological connectivity of random k -dimensional complexes
• A simpler proof of the Boros-Füredi-Bárány-Pach-Gromov theorem
• Singularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetry
• Homological connectivity of random 2-complexes
• Title not available (Why is that?)
• Title not available (Why is that?)
• The homotopy groups of the integral cycle groups
• Title not available (Why is that?)
• Quasifaserungen und unendliche symmetrische Produkte
• Survey article: an elementary illustrated introduction to simplicial sets
• Stabbing simplices by points and flats
• A new lower bound based on Gromov's method of selecting heavily covered points
• Semi-simplicial complexes and singular homology
• Improving the first selection lemma in \(\mathbb{R}^3\)
• Complexity of hypergraph coloring and Seidel's switching.

Cited In (21)

• Expansion of building-like complexes
• The filling problem in the cube
• Random Steiner systems and bounded degree coboundary expanders of every dimension
• Ramanujan complexes and high dimensional expanders
• Upper bounds for stabbing simplices by a line
• Selecting Heavily Covered Points
• Algorithms for colourful simplicial depth and medians in the plane
• Computing colourful simplicial depth and Median in \(\mathbb{R}_2\)
• Bounds for Pach's selection theorem and for the minimum solid angle in a simplex
• Mixing in high-dimensional expanders
• On expansion and topological overlap
• On the hardness of switching to a small number of edges
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
• Isoperimetric inequalities in simplicial complexes
• The intersection of a matroid and an oriented matroid
• Simplicial branching random walks
• A note on lower bounds for colourful simplicial depth
• A new lower bound based on Gromov's method of selecting heavily covered points
• An elementary exposition of topological overlap in the plane
• Simplicial complexes: spectrum, homology and random walks
• Positive-fraction intersection results and variations of weak epsilon-nets

This page was built for publication: On Gromov's method of selecting heavily covered points

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