posted on 2016-06-13, 00:00authored byE Cohen, D Mubayi, P Ralli, P Tetali
We formulate and prove inverse mixing lemmas in the settings of simplicial
complexes and k-uniform hypergraphs. In the hypergraph setting, we extend results
of Bilu and Linial for graphs. In the simplicial complex setting, our results answer a question of Parzanchevski et al.
Funding
Research supported in part by the NSF grants DMS 1101447 and 1407657.
Research supported in part by the NSF grants DMS 0969092 and 1300138.