Related papers: A Generalized Grover/Zeta Correspondence

In this paper, using matrix techniques, we compute the Ihara-zeta function and the number of spanning trees of the join of two semi-regular bipartite graphs. Furthermore, we show that the spectrum and the zeta function of the join of two…

This paper continues a series of investigations on converging representations for the Riemann Zeta function. We generalize some identities which involve Riemann's zeta function, and moreover we give new series and integrals for the zeta…

This paper establishes an upper bound on the number of generalized cospectral mates of simple graphs, where the generalized spectrum consists of the spectrum of a graph and its complement. Moving beyond the classical problem of identifying…

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…

We provide a coherent overview of a number of recent results obtained by the authors in the theory of schemes defined over the field with one element. Essentially, this theory encompasses the study of a functor which maps certain geometries…

The General Randi\'c index $R_\alpha$ of a simple graph $G$ is defined as \[ R_\alpha(G)=\sum_{v_{i}\sim v_{j}} (\delta_{i}\delta_{j})^\alpha, \] where $\delta_i$ denotes the degree of the vertex $v_i$. Rodr\'iguez-Vel\'azquez and…

A universal adjacency matrix of a graph $G$ with adjacency matrix $A$ is any matrix of the form $U = \alpha A + \beta I + \gamma J + \delta D$ with $\alpha \neq 0$, where $I$ is the identity matrix, $J$ is the all-ones matrix and $D$ is the…

In this paper we introduce new generalizations of the zeta function, the Tricomi functions; their main properties are studied. This opens the way to a deeper, better application of these functions both in the theory of special functions,…

In this paper, we introduce a family of graphs which is a generalization of zero-divisor graphs and compute an upper-bound for the diameter of such graphs. We also investigate their cycles and cores.

In various contexts, the zeta function of an object splits into a product of $L$-functions. We categorify this product formula for quadratic covers of objects in the following contexts: quadratic extensions of number fields, ramified double…

Given a graph $G$ one can define the cut polytope CUTP(G) and the metric polytope METP(G) of this graph and those polytopes encode in a nice way the metric on the graph. According to Seymour's theorem, CUTP(G) = METP(G) if and only if K_5…

This paper discusses the simplest examples of spectral zeta functions, especially those associated with graphs, a subject which has not been much studied. The analogy and the similar structure of these functions, such as their parallel…

In this paper, we define edge zeta functions for spherical buildings associated with finite general linear groups. We derive elegant formulas for these zeta functions and reveal patterns of eigenvalues of these buildings, by introducing and…

We calculate the partition function of a harmonic oscillator with quasi-periodic boundary conditions using the zeta-function method. This work generalizes a previous one by Gibbons and contains the usual bosonic and fermionic oscillators as…

For the interpolation of graph signals with generalized shifts of a graph basis function (GBF), we introduce the concept of positive definite functions on graphs. This concept merges kernel-based interpolation with spectral theory on graphs…

Spectral characterization of graphs is an important topic in spectral graph theory, which has received a lot of attention from researchers in recent years. It is generally very hard to show a given graph to be determined by its spectrum.…

The purpose of this paper is to investigate coefficient matrices of functional equations of zeta functions associated with homogeneous cones, which are given explicitly in the previous paper, in detail. We prove that the coefficient matrix…

Graph homomorphism has been studied intensively. Given an m x m symmetric matrix A, the graph homomorphism function is defined as \[Z_A (G) = \sum_{f:V->[m]} \prod_{(u,v)\in E} A_{f(u),f(v)}, \] where G = (V,E) is any undirected graph. The…

We give an elementary combinatorial proof of Bass's determinant formula for the zeta function of a finite regular graph. This is done by expressing the number of non-backtracking cycles of a given length in terms of Chebychev polynomials in…

Here we review the many aspects and distinct phenomena associated to quantum dynamics on general graph structures. For so, we discuss such class of systems under the energy domain Green's function ($G$) framework. This approach is…