𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graph Zeta function and gauge theories

✍ Scribed by Yang-Hui He


Publisher
Springer-Verlag
Year
2011
Tongue
English
Weight
746 KB
Volume
2011
Category
Article
ISSN
1126-6708

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Zeta Functions of Graph Coverings
✍ Hirobumi Mizuno; Iwao Sato πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 123 KB

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

Gauge Theories beyond Gauge Theories
✍ Julius Wess πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 96 KB πŸ‘ 3 views

We introduce the algebra of functions generated by non-commuting coordinates and construct an isomorphism of this algebra to the usual algebra of functions equipped with a non-commutative Γ… product. In order to be able to formulate dynamics and do field theory, we have to define derivatives and inte

Zeta functions in Nielsen theory
✍ A. L. Fel'shtyn πŸ“‚ Article πŸ“… 1988 πŸ› Springer US 🌐 English βš– 236 KB
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

On Zeta Functions of Arithmetically Defi
✍ 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

Zeta Functions of Finite Graphs and Cove
✍ H.M. Stark; A.A. Terras πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 691 KB

Galois theory for normal unramified coverings of finite irregular graphs (which may have multiedges and loops) is developed. Using Galois theory we provide a construction of intermediate coverings which generalizes the classical Cayley and Schreier graph constructions. Three different analogues of A