𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Zeta Functions of Arithmetically Defined Graphs

✍ Scribed by Ortwin Scheja


Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
262 KB
Volume
5
Category
Article
ISSN
1071-5797

No coin nor oath required. For personal study only.

✦ Synopsis


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 that factor over (n), n prime. This allows us to give explicit formulae for the zeta function of X(n) for small n. As an application, we show that these graphs are very good concentrators. Moreover, we construct a new unbounded family of Ramanujan graphs, considering regularizations of X(n).


πŸ“œ 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.

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

Zeta Functions of Discrete Groups Acting
✍ Bryan Clair; Shahriar Mokhtari-Sharghi πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 198 KB

This paper generalizes Bass' work on zeta functions for uniform tree lattices. Using the theory of von Neumann algebras, machinery is developed to define the zeta function of a discrete group of automorphisms of a bounded degree tree. The main theorems relate the zeta function to determinants of ope

On the Value Distribution of Arithmetic
✍ J.W Sander πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 331 KB

In part II of a series of articles on the least common multiple, the central object of investigation was a particular integer-valued arithmetic function g 1 (n). The most interesting problem there was the value distribution of g 1 (n). We proved that the counting function card[n x: g 1 (n) d ] has o

On the Number of Slopes of the Graph of
✍ A. Blokhuis; S. Ball; A.E. Brouwer; L. Storme; T. SzΕ‘nyi πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 116 KB

Given a set U of size q in an affine plane of order q, we determine the possibilities for the number of directions of secants of U, and in many cases characterize the sets U with given number of secant directions.