Ramanujan complexes and high dimensional expanders

By Alexander Lubotzky. 2012

76 citations recorded by the source corpus.

Expander graphs in general, and Ramanujan graphs in particular, have been of great interest in the last four decades with many applications in computer science, combinatorics and even pure mathematics. In these notes we describe various efforts made in recent years to generalize these notions from graphs to higher dimensional simplicial complexes.

Subfields: Discrete Mathematics and Combinatorics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/3af1f0cb732f12d7ca181af39512229ca5ac3922

Citations in the corpus

• Expansion of random graphs: new proofs, new results (2012, unknown): “[28,35,50]).”