Inverse expander mixing for hypergraphs (Q281623): Difference between revisions

Summary: 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 \textit{Y. Bilu} and \textit{N. Linial} [Combinatorica 26, No. 5, 495--519 (2006; Zbl 1121.05054)] for graphs. In the simplicial complex setting, our results answer a question of \textit{O. Parzanchevski} et al. [``Isoperimetric inequalities in simplicial complexes'', Preprint, \url{arXiv:1207.0638}].