Elementary Number Theory, Group Theory and Ramanujan Graphs
Elementary Number Theory, Group Theory and Ramanujan Graphs
Peter Sarnak, Princeton University, New Jersey and New York University
Alain Valette, Université de Neuchâtel, Switzerland
This text is a self-contained study of expander graphs, specifically, their explicit construction. Expander graphs are highly connected but sparse, and while being of interest within combinatorics and graph theory, they can also be applied to computer science and engineering. Only a knowledge of elementary algebra, analysis and combinatorics is required because the authors provide the necessary background from graph theory, number theory, group theory and representation theory. Thus the text can be used as a brief introduction to these subjects and their synthesis in modern mathematics.
- Self-contained treatment
- Provides the necessary background from graph theory, number theory, group theory and representation theory
- Subject has many applications in computer science and engineering
Reviews & endorsements
"It would make a great text for an honors or senior seminar, showing how elegantly many different areas of mathematics come together to solve a very concrete problem of broad interest and application." Mathematical Reviews
"...a well written and stimulating book." MAA Online Book Review
Product details
January 2003Paperback
9780521531436
156 pages
240 × 149 × 11 mm
0.22kg
Available
Table of Contents
- An overview
- 1. Graph theory
- 2. Number theory
- 3. PSL2(q)
- 4. The graphs Xp,q
- Appendix A. 4-regular graphs with large girth
- Index
- Bibliography.
