Overlap properties of geometric expanders

The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) ∈ (0, 1] such that no matter how we map the vertices of H into ℝ[superscript d], there is a point covered by at least a c(H)-fraction of the simplices induced by the images of its hyperedges. Motivated by the se...

Full description

Bibliographic Details
Main Authors: Fox, Jacob (Contributor), Gromov, Mikhail (Author), Lafforgue, Vincent (Author), Naor, Assaf (Author), Pach, Janos (Author)
Other Authors: Massachusetts Institute of Technology. Department of Mathematics (Contributor)
Format: Article
Language:English
Published: Walter de Gruyter, 2013-09-20T15:13:47Z.
Subjects:
Online Access:Get fulltext