✦ LIBER ✦

Zeta Functions of Graph Coverings

✍ Scribed by Hirobumi Mizuno; Iwao Sato

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 123 KB
Volume: 80
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.2000.1983

No coin nor oath required. For personal study only.

✦ Synopsis

We give a decomposition formula for the zeta function of a group covering of a graph.

📜 SIMILAR VOLUMES

On Zeta Functions of Arithmetically Defi

On Zeta Functions of Arithmetically Defined Graphs

✍ Ortwin Scheja 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 262 KB

We study the graph X(n) that is de"ned as the "nite part of the quotient (n)!T, with T the Bruhat}Tits tree over % O ((1/¹ )) and (n) the principal congruence subgroup of "G¸(% We give concrete realizations of the ¸-functions of the "nite part of the hal#ine !T for "nite unitary representations of

Enumeration of connected graph coverings

✍ Kwak, Jin Ho; Lee, Jaeun 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 207 KB 👁 1 views

The number of the isomorphism classes of n-fold coverings of a graph G is enumerated by the authors (Canad.

A Note on the Zeta Function of a Graph

✍ Sam Northshield 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 113 KB

The number of spanning trees in a finite graph is first expressed as the derivative (at 1) of a determinant and then in terms of a zeta function. This generalizes a result of Hashimoto to non-regular graphs. ## 1998 Academic Press Let G be a finite graph. The complexity of G, denoted }, is the num

N-Rationality of Zeta Functions

✍ Christophe Reutenauer 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 187 KB

Fourth moments of grossencharakteren zet

Fourth moments of grossencharakteren zeta functions

✍ Peter Sarnak 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 392 KB

Tilings, packings, coverings, and the ap

Tilings, packings, coverings, and the approximation of functions

✍ Aicke Hinrichs; Christian Richter 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 279 KB

## Abstract A packing (resp. covering) ℱ of a normed space __X__ consisting of unit balls is called completely saturated (resp. completely reduced) if no finite set of its members can be replaced by a more numerous (resp. less numerous) set of unit balls of __X__ without losing the packing property