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 ele
Elementary number theory, group theory, and Ramanujan graphs
โ Scribed by Giuliana Davidoff, Peter Sarnak, Alain Valette
- Publisher
- Cambridge University Press
- Year
- 2003
- Tongue
- English
- Leaves
- 154
- Series
- London Mathematical Society student texts 55
- Category
- Library
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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 ele
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 ele
This volume consists of contributions by participants and speakers at two conferences. The first was entitled Combinatorial Group Theory, Discrete Groups and Number Theory and was held at Fairfield University, December 8-9, 2004. It was in honor of Professor Gerhard Rosenberger's sixtieth birthday.
This notes has been used between 1981 and 1990 by the author at Imperial College, University of London.