Inverse Expander Mixing for Hypergraphs
classification
🧮 math.CO
keywords
hypergraphsinversemixingresultssettingsimplicialanswerbilu
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.