Related papers: A Generalized Grover/Zeta Correspondence
We define a zeta function of a finite graph derived from time evolution matrix of quantum walk, and give its determinant expression. Furthermore, we generalize the above result to a periodic graph.
The vertices of a $k$-token graph of a graph $G$ correspond to $k$ indistinguishable tokens placed on $k$ different vertices of $G$. Changing some conditions on both the nature of the tokens and the number of tokens allowed in each vertex…
The Ihara expression of a weighted zeta function for a general finite digraph is given. It unifies all the Ihara expressions obtained for known zeta functions for finite digraphs. Any digraph in this paper permits multi-edges and…
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…
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…
A new generalization of Fiedler's lemma is obtained by introducing the concept of the main function of a matrix. As applications, the universal spectra of the H-join, the spectra of the H-generalized join and the spectra of the generalized…
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 introduce a way to generalize the Euler's gamma function as well as some related special functions. With a given polynomial in one variable $f(t)\ge 0$, we can associate a function, so-called "gamma function associated…
We construct spectral zeta functions for the Dirac operator on metric graphs. We start with the case of a rose graph, a graph with a single vertex where every edge is a loop. The technique is then developed to cover any finite graph with…
We compute the equivariant zeta function for bundles over infinite graphs and for infinite covers. In particular, we give a ``transfer formula'' for the zeta function of infinite graph covers. Also, when the infinite cover is given as a…
Along the recently trodden path of studying certain number theoretic properties of gauge theories, especially supersymmetric theories whose vacuum manifolds are non-trivial, we investigate Ihara's Graph Zeta Function for large classes of…
We present an explicit formula for the determinant on the Metzler matrix of a digraph $D$. Furthermore, we introduce a walk-type zeta function with respect to this Metzler matrix of the symmetric digraph of a finite torus, and express its…
Recently, Gnutzmann and Smilansky presented a formula for the bond scattering matrix of a graph with respect to a Hermitian matrix. We present another proof for this Gnutzmann and Smilansky's formula by a technique used in the zeta function…
In [19] it was explained how one can naturally associate a Deitmar scheme (which is a scheme defined over the field with one element, $\mathbb{F}_1$) to a so-called "loose graph" (which is a generalization of a graph). Several properties of…
An analysis of the zeta and gamma function is presented, using elementary functions like [] and {}, a general formula for the angle of zeta(1/2 + i*n) is found and the same for the gamma function.
We introduce a zeta function of digraphs that determines, and is determined by, the spectra of all linear combinations of the adjacency matrix, its transpose, the out-degree matrix, and the in-degree matrix. In particular, zeta-equivalence…
For any given graph G = (V,E) we define in a certain way a new graph G(x,y,z) with the vertex set V\cup E depending on parameters x,y,z from {0,1, +, -} and call graph G(x,y,z) the (x,y,z)-transformation of G. It turns out that if G is an…
For a simple graph $G$, the generalized adjacency matrix $A_{\alpha}(G)$ is defined as $A_{\alpha}(G)=\alpha D(G)+(1-\alpha)A(G), \alpha\in [0,1]$, where $A(G)$ is the adjacency matrix and $D(G)$ is the diagonal matrix of vertex degrees of…
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…
We generalize the Ihara-Selberg zeta function to hypergraphs in a natural way. Hashimoto's factorization results for biregular bipartite graphs apply, leading to exact factorizations. For $(d,r)$-regular hypergraphs, we show that a modified…