Overlap properties of geometric expanders

The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) is an element of (0, 1] such that no matter how we map the vertices of H into R-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 search for an analogue of the notion of graph expansion for higher dimensional simplicial complexes, we address the question whether or not there exists a sequence {H-n}(n=1)(infinity) of arbitrarily large (d + 1)-uniform hypergraphs with bounded degree for which inf(n >= 1) c(H-n) > 0. Using both random methods and explicit constructions, we answer this question positively by constructing infinite families of (d + 1)-uniform hypergraphs with bounded degree such that their overlap numbers are bounded from below by a positive constant c = c(d). We also show that, for every d, the best value of the constant c = c(d) that can be achieved by such a construction is asymptotically equal to the limit of the overlap numbers of the complete (d + 1)-uniform hypergraphs with n vertices, as n -> infinity. For the proof of the latter statement, we establish the following geometric partitioning result of independent interest. For any h, s and any epsilon > 0, there exists K = K(epsilon, h, s) satisfying the following condition. For any k >= K and for any semi-algebraic relation R on h-tuples of points in a Euclidean space R-d with description complexity at most s, every finite set P subset of R-d has a partition P = P-1 boolean OR ... boolean OR P-k into k parts of sizes as equal as possible such that all but at most an epsilon-fraction of the h-tuples (P-i1, ... , P-ih) have the property that either all h-tuples of points with one element in each P-ij are related with respect to R or none of them are.

Published in:
Proc. 22nd ACM-SIAM Symposium on Discrete Algorithms, 1188-1197
Presented at:
22nd ACM-SIAM Symposium on Discrete Algorithms
Berlin, Walter De Gruyter & Co

 Record created 2011-12-12, last modified 2018-03-17

Rate this document:

Rate this document:
(Not yet reviewed)