arXiv · 1904.03533
From Ramanujan Graphs to Ramanujan Complexes
Abstract
Ramanujan graphs are graphs whose spectrum is bounded optimally. Such graphs have found numerous applications in combinatorics and computer science. In recent years, a high dimensional theory has emerged. In this paper these developments are surveyed. After explaining their connection to the Ramanujan conjecture we will present some old and new results with an emphasis on random walks on these discrete objects and on the Euclidean spheres. The latter lead to "golden gates" which are of importance in quantum computation.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Alexander Lubotzky, Ori Parzanchevski. 2019-04-06. From Ramanujan Graphs to Ramanujan Complexes. https://doi.org/10.1098/rsta.2018.0445
Cite the original work for its findings. Save a collection to share your selection of sources.