Overlap properties of geometric expanders

From MaRDI portal
Publication:3168403




Abstract: The {em overlap number} of a finite (d+1)-uniform hypergraph H is defined as the largest constant c(H)in(0,1] such that no matter how we map the vertices of H into Rd, there is a point covered by at least a c(H)-fraction of the simplices induced by the images of its hyperedges. In~cite{Gro2}, motivated by the search for an analogue of the notion of graph expansion for higher dimensional simplicial complexes, it was asked whether or not there exists a sequence Hnn=1infty of arbitrarily large (d+1)-uniform hypergraphs with bounded degree, for which infnge1c(Hn)>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 nightarrowinfty. For the proof of the latter statement, we establish the following geometric partitioning result of independent interest. For any d and any epsilon>0, there exists K=K(epsilon,d)ged+1 satisfying the following condition. For any kgeK, for any point qinmathbbRd and for any finite Borel measure mu on mathbbRd with respect to which every hyperplane has measure 0, there is a partition mathbbRd=A1cupldotscupAk into k measurable parts of equal measure such that all but at most an epsilon-fraction of the (d+1)-tuples Ai1,ldots,Aid+1 have the property that either all simplices with one vertex in each Aij contain q or none of these simplices contain q.




Cited in
(45)






This page was built for publication: Overlap properties of geometric expanders

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