Zeta Functions of Graphs
A Stroll through the Garden
$69.99 (C)
Part of Cambridge Studies in Advanced Mathematics
 Author: Audrey Terras, University of California, San Diego
 Date Published: December 2010
 availability: Available
 format: Hardback
 isbn: 9780521113670
$
69.99
(C)
Hardback
Other available formats:
eBook
Looking for an examination copy?
If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Graph theory meets number theory in this stimulating book. Ihara zeta functions of finite graphs are reciprocals of polynomials, sometimes in several variables. Analogies abound with numbertheoretic functions such as Riemann/Dedekind zeta functions. For example, there is a Riemann hypothesis (which may be false) and prime number theorem for graphs. Explicit constructions of graph coverings use Galois theory to generalize Cayley and Schreier graphs. Then nonisomorphic simple graphs with the same zeta are produced, showing you cannot hear the shape of a graph. The spectra of matrices such as the adjacency and edge adjacency matrices of a graph are essential to the plot of this book, which makes connections with quantum chaos and random matrix theory, plus expander/Ramanujan graphs of interest in computer science. Pitched at beginning graduate students, the book will also appeal to researchers. Many wellchosen illustrations and diagrams, and exercises throughout, theoretical and computerbased.
Read more Makes connections with quantum chaos and random matrix theory, plus Ramanujan graphs, which are of interest to computer scientists
 Explains key ideas using lots of wellchosen illustrations, alongside theoretical and computerbased exercises
 Perfect for beginning graduate students, or established researchers who want a stimulating introduction to the topic
Reviews & endorsements
"The book brings together existing research into a coherent presentation..."
Christopher Knox Storm, Mathematical ReviewsCustomer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
 Date Published: December 2010
 format: Hardback
 isbn: 9780521113670
 length: 252 pages
 dimensions: 235 x 157 x 19 mm
 weight: 0.53kg
 contains: 65 b/w illus. 11 colour illus. 95 exercises
 availability: Available
Table of Contents
List of illustrations
Preface
Part I. A Quick Look at Various Zeta Functions:
1. Riemann's zeta function and other zetas from number theory
2. Ihara's zeta function
3. Selberg's zeta function
4. Ruelle's zeta function
5. Chaos
Part II. Ihara's Zeta Function and the Graph Theory Prime Number Theorem:
6. Ihara zeta function of a weighted graph
7. Regular graphs, location of poles of zeta, functional equations
8. Irregular graphs: what is the RH?
9. Discussion of regular Ramanujan graphs
10. The graph theory prime number theorem
Part III. Edge and Path Zeta Functions:
11. The edge zeta function
12. Path zeta functions
Part IV. Finite Unramified Galois Coverings of Connected Graphs:
13. Finite unramified coverings and Galois groups
14. Fundamental theorem of Galois theory
15. Behavior of primes in coverings
16. Frobenius automorphisms
17. How to construct intermediate coverings using the Frobenius automorphism
18. Artin Lfunctions
19. Edge Artin Lfunctions
20. Path Artin Lfunctions
21. Nonisomorphic regular graphs without loops or multiedges having the same Ihara zeta function
22. The Chebotarev Density Theorem
23. Siegel poles
Part V. Last Look at the Garden:
24. An application to errorcorrecting codes
25. Explicit formulas
26. Again chaos
27. Final research problems
References
Index.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org
Register Sign in» Proceed