Zeta functions of graphs : a stroll through the garden /
"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...
Guardado en:
| Autor Principal: | |
|---|---|
| Formato: | Libro |
| Idioma: | English |
| Publicado: |
Cambridge ; New York :
Cambridge University Press,
2011.
|
| Series: | Cambridge studies in advanced mathematics ;
128 |
| Materias: | |
| Acceso en línea: | Publisher description Table of contents |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| LEADER | 02082cam a2200265 a 4500 | ||
|---|---|---|---|
| 001 | MAT.inmabb006694 | ||
| 008 | 100615s2011####enka#####b####001#0#eng## | ||
| 005 | 20121031175525.0 | ||
| 245 | 1 | 0 | |a Zeta functions of graphs : |b a stroll through the garden / |c Audrey Terras. |
| 260 | |a Cambridge ; |a New York : |b Cambridge University Press, |c 2011. | ||
| 300 | |a xii, 239 p. : |b il. ; |c 24 cm. | ||
| 490 | 0 | |a Cambridge studies in advanced mathematics ; |v 128 | |
| 504 | |a Incluye referencias bibliográficas (p. 230-235) e índice. | ||
| 520 | |a "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, are included throughout."-- |c Provided by publisher. | ||
| 510 | 4 | |a MR, |c 2012d:05016 | |
| 020 | |a 9780521113670 | ||
| 100 | 1 | |a Terras, Audrey. | |
| 650 | 0 | |a Graph theory. | |
| 650 | 0 | |a Functions, Zeta. | |
| 084 | |a 05-02 (05C25 11M41) |2 msc2000 | ||
| 010 | |a 2010024611 | ||
| 040 | |a DLC |c DLC |d DLC | ||
| 856 | 4 | 2 | |3 Publisher description |u http://www.loc.gov/catdir/enhancements/fy1108/2010024611-d.html |
| 856 | 4 | 1 | |3 Table of contents |u http://www.loc.gov/catdir/enhancements/fy1108/2010024611-t.html |
| 859 | |h 05 |i T324 |p A-8788 |b BIB. MATEMATICA | ||