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

For a generic (polynomial) one-parameter deformation of a complete intersection, there is defined its monodromy zeta-function. We provide explicit formulae for this zeta-function in terms of the corresponding Newton polyhedra in the case…

As introduced by Gutman and Harary, the independence polynomial of a graph serves as the generating polynomial of its independent sets. In 1987, Alavi, Malde, Schwenk and Erd\H{o}s conjectured that the independence polynomials of all trees…

We compute in a direct (not algorithmic) way the zeta function of all supersingular curves of genus 2 over a finite field k, with many geometric automorphisms. We display these computations in an appendix where we select a family of…

In this note, we give an exact formula for a general family of rational zeta series involving the coefficient $\zeta(2n)$ in terms of Hurwitz zeta values. This formula generalizes two formulas from a previous paper of the first author. Our…

The connection between the recoupling scheme of four copies of $\mathfrak{su}(1,1)$, the generic superintegrable system on the 3 sphere, and bivariate Racah polynomials is identified. The Racah polynomials are presented as connection…

The even weight period polynomial relations in the double shuffle Lie algebra $\mathfrak{ds}$ were discovered by Ihara, and completely classified by the second author by relating them to restricted even period polynomials associated to cusp…

We consider the generating polynomial of the number of rooted trees on the set $\{1,2,\dots,n\}$ counted by the number of descending edges (a parent with a greater label than a child). This polynomial is an extension of the descent…

If alpha=alpha(G) is the maximum size of an independent set and s_{k} equals the number of stable sets of cardinality k in graph G, then I(G;x)=s_{0}+s_{1}x+...+s_{alpha}x^{alpha} is the independence polynomial of G. In this paper we prove…

We introduce a new cohomology theory for planar trivalent graphs with perfect matchings. The graded Euler characteristic of the cohomology is a one variable polynomial called the 2-factor polynomial that, if nonzero when evaluated at one,…

To a singular knot K with n double points, one can associate a chord diagram with n chords. A chord diagram can also be understood as a 4-regular graph endowed with an oriented Euler circuit. L. Traldi introduced a polynomial invariant for…

For every finite simple connected graph $G = (V,E)$, we introduce an invariant, its blowup-polynomial $p_G(\{ n_v : v \in V \})$. This is obtained by dividing the determinant of the distance matrix of its blowup graph $G[{\bf n}]$…

The hypergeometric zeta function is defined in terms of the zeros of the Kummer function M(a, a + b; z). It is established that this function is an entire function of order 1. The classical factorization theorem of Hadamard gives an…

Let $G$ be a simple undirected $n$-vertex graph with the characteristic polynomial of its Laplacian matrix $L(G)$, $\det (\lambda I - L (G))=\sum_{k = 0}^n (-1)^k c_k \lambda^{n - k}$. Laplacian--like energy of a graph is newly proposed…

We introduce a new method for computing massless Feynman integrals analytically in parametric form. An analysis of the method yields a criterion for a primitive Feynman graph $G$ to evaluate to multiple zeta values. The criterion depends…

We introduce a new type of multiple zeta functions, which we call bilateral zeta functions, analogous to the Barnes zeta functions. The bilateral zeta function is a periodic function and shares certain basic properties of Barnes zeta…

Dual Seidel switching is a graph operation introduced by W.~Haemers in 1984. This operation can change the graph, however it does not change its bipartite double, and because of this, the operation leaves the squares of the eigenvalues…

Let $G$ be a bipartite graph on $n$ vertices with the Laplacian matrix $L_G$. When $G$ is a tree, inequalities involving coefficients of immanantal polynomials of $L_G$ are known as we go up $GTS_n$ poset of unlabelled trees with $n$…

A graph with at most two vertices of the same degree is called antiregular (Merris 2003), maximally nonregular (Zykov 1990) or quasiperfect (Behzad, Chartrand 1967). If s_{k} is the number of independent sets of cardinality k in a graph G,…

The interior polynomial is an invariant of (signed) bipartite graphs, and the interior polynomial of a plane bipartite graph is equal to a part of the HOMFLY polynomial of a naturally associated link. The HOMFLY polynomial $P_L(v,z)$ is a…

We revisit the theory of Ihara $L$-functions in the context initially studied by Bass and Hashimoto and more recently by Zakharov. In particular, we study if the Artin formalism is satisfied by these $L$-functions. As an application, we…