2001/01/01 by Giuliana P. Davidoff, Peter Sarnak, Alain Valette · 12 citations
Chemistry · Mathematics · Physics and Astronomy · #Advanced Mathematical Theories and Applications #Algebra over a field #Combinatorics #Computer science #Discrete mathematics #Expander graph #Graph #Graph theory #Graph theory and applications #Group (periodic table) #Group theory #History and advancements in chemistry #Mathematics #Number theory #Physics #Pure mathematics #Ramanujan's sum #Representation theory
paper · doi:10.1017/cbo9780511615825
openalex publication_date 2001/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/30
This text is a self contained treatment of expander graphs and in particular their explicit construction. Expander graphs are both highly connected but sparse, and besides their interest within combinatorics and graph theory, they also find various applications in computer science and engineering. The reader needs only a background in elementary algebra, analysis and combinatorics; the authors supply the necessary background material from graph theory, number theory, group theory and representation theory. The text can therefore be used as a brief introduction to these subjects as well as an illustration of how such topics are synthesised in modern mathematics.