ShopSpell

Zeta Functions of Graphs A Stroll through the Garden [Hardcover]

$92.99       (Free Shipping)
77 available
  • Category: Books (Mathematics)
  • Author:  Terras, Audrey
  • Author:  Terras, Audrey
  • ISBN-10:  0521113679
  • ISBN-10:  0521113679
  • ISBN-13:  9780521113670
  • ISBN-13:  9780521113670
  • Publisher:  Cambridge University Press
  • Publisher:  Cambridge University Press
  • Pages:  252
  • Pages:  252
  • Binding:  Hardcover
  • Binding:  Hardcover
  • Pub Date:  01-May-2010
  • Pub Date:  01-May-2010
  • SKU:  0521113679-11-MPOD
  • SKU:  0521113679-11-MPOD
  • Item ID: 100944819
  • Seller: ShopSpell
  • Ships in: 2 business days
  • Transit time: Up to 5 business days
  • Delivery by: Jul 02 to Jul 04
  • Notes: Brand New Book. Order Now.
Combinatorics meets number theory in this stimulating stroll through the zetas. Includes well-chosen illustrations and exercises, both theoretical and computer-based.This stimulating introduction to zeta (and related) functions of graphs develops the fruitful analogy between combinatorics and number theory - for example, the Riemann hypothesis for graphs - making connections with quantum chaos, random matrix theory, and computer science. Many well-chosen illustrations and exercises, both theoretical and computer-based, are included throughout.This stimulating introduction to zeta (and related) functions of graphs develops the fruitful analogy between combinatorics and number theory - for example, the Riemann hypothesis for graphs - making connections with quantum chaos, random matrix theory, and computer science. Many well-chosen illustrations and exercises, both theoretical and computer-based, are included throughout.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 number-theoretic 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 non-isomorphic 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 well-chosen illustrations and diagrams, and exercises throughout, theoretical and computer-based.List of illustrations; Preface; Part I. A Quick Look at Varló
Add Review