Related papers: Artin-Ihara L-functions for hypergraphs
This paper is about the determinantal identities associated with the Ihara (Ih) zeta function of a non directed graph and the Bowen-Lanford (BL) zeta function of a directed graph. They will be called the Ih and the BL identities in this…
It is shown by Mizuno and Sato that the Bartholdi zeta function of a covering graph is decomposed as a product of Bartholdi zeta functions of a base graph that are associated with representations. In this paper, we extend their result to…
In this note we define L-functions of finite graphs and study the particular case of finite cycles in the spirit of a previous paper that studied spectral zeta functions of graphs. The main result is a suggestive equivalence between an…
In this paper we investigate Ramanujan hypergraphs by using hypergraph coverings. We first show that the spectrum of a $k$-fold covering $\bar{H}$ of a connected hypergraph $H$ contains the spectrum of $H$, and that it is the union of the…
In this paper, we give a more direct proof of the results by Clair and Mokhtari-Sharghi on the zeta functions of periodic graphs. In particular, using appropriate operator-algebraic techniques, we establish a determinant formula in this…
In this paper, we investigate the derivatives of L-functions, in particular, the Riemann zeta function, the Hasse-Weil L-function, the Rankin L-function and the Artin L-function, and survey the relations between the derivatives of…
We initiate the study of spectral zeta functions $\zeta_{X}$ for finite and infinite graphs $X$, instead of the Ihara zeta function, with a perspective towards zeta functions from number theory and connections to hypergeometric functions.…
Arising from the factorizations of Dedekind zeta-functions of cubic fields, we obtain Artin $L$-functions of certain two-dimensional representations. In this paper, we study the value-distribution of such Artin $L$-functions for families of…
The reciprocal of the Ihara zeta function of a graph is a polynomial invariant introduced by Ihara in 1966. Scott and Storm gave a method to determine the coefficients of the polynomial. Here we simplify their calculation and determine the…
For graphs $G$ and $H$, an {\em $H$-colouring} of $G$ (or {\em homomorphism} from $G$ to $H$) is a function from the vertices of $G$ to the vertices of $H$ that preserves adjacency. $H$-colourings generalize such graph theory notions as…
We establish the quaternionic weighted zeta function of a graph and its Study determinant expressions. For a graph with quaternionic weights on arcs, we define a zeta function by using an infinite product which is regarded as the Euler…
The scattering process on multiloop infinite p+1-valent graphs (generalized trees) is studied. These graphs are discrete spaces being quotients of the uniform tree over free acting discrete subgroups of the projective group $PGL(2, {\bf…
Stark and Terras introduced the edge zeta function of a finite graph in 1996. The edge zeta function is the reciprocal of a polynomial in twice as many variables as edges in the graph and can be computed in polynomial time. We look at graph…
In this paper we study spectral zeta functions associated to finite and infinite graphs. First we establish a meromorphic continuation of these functions under some general conditions. Then we study special values in the case of standard…
If one proposes to use the theory of Eisenstein cohomology to prove algebraicity results for the special values of automorphic L-functions as in my work with Harder for Rankin-Selberg L-functions, or its generalizations as in my work with…
It is known that the canonical double cover of any connected nonbipartite graph have an automorphism group of the form $H \rtimes \mathbb{Z}_2$, where $H$ is the set of automorphism which preserve bipartite parts. We construct connected…
For given graphs $G$ and $H$, let $|Hom(G,H)|$ denote the set of graph homomorphisms from $G$ to $H$. We show that for any finite, $n$-regular, bipartite graph $G$ and any finite graph $H$ (perhaps with loops), $|Hom(G,H)|$ is maximum when…
Let $x_1, \ldots, x_n \in \mathbb{R}^d$ be unit vectors such that among any three there is an orthogonal pair. How large can $n$ be as a function of $d$, and how large can the length of $x_1 + \ldots + x_n$ be? The answers to these two…
Let $X$ denote a connected $(q+1)$-regular undirected graph of finite order $n$. The graph $X$ is called Ramanujan whenever $$ |\lambda|\leq 2q^{\frac{1}{2}} $$ for all nontrivial eigenvalues $\lambda$ of $X$. We consider the variant…
The analytic properties of automorphic L-functions have historically been obtained either through integral representations (the "Rankin-Selberg method"), or properties of the Fourier expansions of Eisenstein series (the "Langlands-Shahidi…