2019
DOI: 10.1098/rsta.2018.0445
|View full text |Cite
|
Sign up to set email alerts
|

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 … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(8 citation statements)
references
References 41 publications
(88 reference statements)
0
8
0
Order By: Relevance
“…They give the GP-graphs Γ(q ℓ + 1, q m ), with q = p, considered in [20] for q a power of p. Notice that the graphs Γ(3, 2 2t ) with t ≥ 2 and Γ(4, 3 2t ) with t ≥ 1 belong to both families given in (i) and (ii). For instance, Γ (3,16), Γ(3, 64), and Γ(4, 81) are semiprimitive GP-graphs.…”
Section: Semiprimitive Generalized Paley Graphsmentioning
confidence: 99%
“…They give the GP-graphs Γ(q ℓ + 1, q m ), with q = p, considered in [20] for q a power of p. Notice that the graphs Γ(3, 2 2t ) with t ≥ 2 and Γ(4, 3 2t ) with t ≥ 1 belong to both families given in (i) and (ii). For instance, Γ (3,16), Γ(3, 64), and Γ(4, 81) are semiprimitive GP-graphs.…”
Section: Semiprimitive Generalized Paley Graphsmentioning
confidence: 99%
“…As shown by Parzanchevski & Sarnak [14], the image of Λ p in PU(2) distributes uniformly, and S p is a Golden Gates Set in quantum computation. For a survey of this topic, the reader is referred to [13].…”
Section: (B) Other Applications Of the Ramanujan Conjecturementioning
confidence: 99%
“…The Golden-Gate Sets arise from first representing the Hecke operators of PGL n (F) by global points and then regarding them locally as points at the place at ∞. (See [5,13,14] for more details.) The role of the Ramanujan conjecture is also explained.…”
Section: Introductionmentioning
confidence: 99%
“…Considerable attention has been devoted to the reconstruction of large networks, e.g., expander graphs and Ramanujan graphs [5,8,9], starting from their geometry at large. Possibly infinite graphs with thin or no loops, for instance trees and more general Gromov hyperbolic graphs, real trees and dendrites have also been extensively studied in the literature in relation with their boundaries.…”
Section: Introductionmentioning
confidence: 99%