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.
| Original language | English |
|---|---|
| Article number | 20180445 |
| Journal | Philosophical transactions. Series A, Mathematical, physical, and engineering sciences |
| Volume | 378 |
| Issue number | 2163 |
| DOIs | |
| State | Published - 24 Jan 2020 |
Keywords
- Complexes
- Graphs
- Ramanujan
All Science Journal Classification (ASJC) codes
- General Mathematics
- General Engineering
- General Physics and Astronomy
Fingerprint
Dive into the research topics of 'From Ramanujan graphs to Ramanujan complexes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver