2014/07/08 by Emma Cohen, Cohen, Emma, Dhruv Mubayi +5
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO
paper · pdf · doi:10.48550/arxiv.1407.2285
arxiv created 2014/07/08 · arxiv updated 2014/07/10
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.