Related papers: Ihara zeta functions for some simple graph familie…

We intimate deeper connections between the Riemann zeta and gamma functions than often reported and further derive a new formula for expressing the value of $\zeta(2n+1)$ in terms of zeta at other fractional points. This paper also…

We obtain first order linear partial differential equations which are satisfied by exponential generating functions of two variables for the number of connected bipartite graphs with given Betti number. By solving these equations…

To a finite, connected, unoriented graph of Betti-number g>=2 and valencies >=3 we associate a finitely summable, commutative spectral triple (in the sense of Connes), whose induced zeta functions encode the graph. This gives another…

Let $G_1$ and $G_2$ be two simple connected graphs. The invariant \textit{coronal} of graph is used in order to determine the $\alpha$-eigenvalues of four different types of graph equations that are $G_1 \circ G_2, G_1\lozenge G_1$ and the…

In this article, we construct explicit examples of pairs of non-isomorphic trees with the same restricted $U$-polynomial for every $k$; by this we mean that the polynomials agree on terms with degree at most $k+1$. The main tool for this…

Historically known as the Basel problem, evaluating the Riemann zeta function at two has resulted in numerous proofs, many of which have been generalized to compute the function's values at even positive integers. We apply Parseval's…

This article proves the Riemann hypothesis, which states that all non-trivial zeros of the zeta function have a real part equal to 1/2. We inspect in detail the integral form of the (symmetrized) completed zeta function, which is a product…

We investigate the horizontal distribution of zeros of the derivative of the Riemann zeta function and compare this to the radial distribution of zeros of the derivative of the characteristic polynomial of a random unitary matrix. Both…

We obtain a weighted sum formula of the zeta values at even arguments, and a weighted sum formula of the multiple zeta values with even arguments and its zeta-star analogue. The weight coefficients are given by (symmetric) polynomials of…

Using a summation identity obtained for the Fourier coefficients of $x^{2k}$, we derive a closed form expression for the zeta function at even positive integers, using a technique similar to one in an existing proof by Aladdi and Defant[1],…

We define a zeta function of a graph by using the time evolution matrix of a general coined quantum walk on it, and give a determinant expression for the zeta function of a finite graph. Furthermore, we present a determinant expression for…

Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…

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 give two determinantal representations for a bivariate polynomial. They may be used to compute the zeros of a system of two of these polynomials via the eigenvalues of a two-parameter eigenvalue problem. The first determinantal…

Using Parseval's identity for the Fourier coefficients of $x^k$, we provide a new proof that $\zeta(2k)=\dfrac{(-1)^{k+1}B_{2k}(2\pi)^{2k}}{2(2k)!}$.

We prove optimality of the Arf invariant formula for the generating function of even subgraphs, or, equivalently, the Ising partition function, of a graph.

We calculate zeta functions for certain orders of rank $3$ defined by standard integral table algebras and integral fusion rings that have irrational-valued irreducible characters. The calculations are obtained from explicit calculations of…

Let $A$ be a commutative $k$-algebra over a field of $k$ and $\Xi$ a linear operator defined on $A$. We define a family of $A$-valued invariants $\Psi$ for finite rooted forests by a recurrent algorithm using the operator $\Xi$ and show…

One way to study certain classes of polynomials is by considering examples that are attached to combinatorial objects. Any graph $G$ has an associated reciprocal polynomial $R_G$, and with two particular classes of reciprocal polynomials in…

The generalized degree polynomial $\mathbf{G}_T(x,y,z)$ of a tree $T$ is an invariant introduced by Crew that enumerates subsets of vertices by size and number of internal and boundary edges. Aliste-Prieto et al. proved that $\mathbf{G}_T$…