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

We give an anecdotal discussion of the problem of searching for polynomials with all roots on the unit circle, whose coefficients are rational numbers subject to certain congruence conditions. We illustrate with an example from a…

We explore Fourier transforms of the reciprocal of the Riemann zeta function that have connections to the RH. A partial answer to a recently posed problem is explored by exploiting the fact that $\zeta(s)\neq0$ when $\Re(s)=1.$

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 introduce a ``non-orientable'' variation of Serre's definition of a graph, which we call an abstract isogeny graph. These objects capture the combinatorics of the graphs $G(p,\ell,H)$, the $\ell$-isogeny graphs of supersingular elliptic…

An oriented graph $D$ is converse invariant if, for any tournament $T$, the number of copies of $D$ in $T$ is equal to that of its converse $-D$. El Sahili and Ghazo Hanna [J. Graph Theory 102 (2023), 684-701] showed that any oriented graph…

Graph polynomials are graph parameters invariant under graph isomorphisms which take values in a polynomial ring with a fixed finite number of indeterminates. We study graph polynomials from a model theoretic point of view. In this paper we…

The $k^{th}$-power of a given graph $G=(V,E)$ is obtained from $G$ by adding an edge between every two distinct vertices at a distance at most $k$ in $G$. We call $G$ a $k$-Steiner power if it is an induced subgraph of the $k^{th}$-power of…

In this paper, some new results are reported for the study of Riemann zeta function $\zeta(s)$ in the critical strip $0<Re(s)<1$, such as $\zeta(s)$ expressed in a generalized Euler product only involving prime numbers. Particularly, some…

In the 70's Igusa developed a uniform theory for local zeta functions and oscillatory integrals attached to polynomials with coefficients in a local field of characteristic zero. In the present article this theory is extended to the case 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.

It is well known that the coefficients of the matching polynomial are unimodal. Unimodality of the coefficients (or their absolute values) of other graph polynomials have been studied as well. One way to prove unimodality is to prove…

Extending the Eulerian functions, we study their relationship with zeta function of several variables. In particular, starting with Weierstrass factorization theorem (and Newton-Girard identity) for the complex Gamma function, we are…

In arXiv:1709.07504 Ardila and Aguiar give a Hopf monoid structure on hypergraphs as well as a general construction of polynomial invariants on Hopf monoids. Using these results, we define in this paper a new polynomial invariant on…

In this paper, we study the graph polynomial that counts spanning rooted forests f_g of a given graph. This polynomial has a remarkable reciprocity property. We give a new bijective proof for this theorem which has Prufer coding as a…

In this work we introduce a new polynomial representation of the Bernoulli numbers in terms of polynomial sums allowing on the one hand a more detailed understanding of their mathematical structure and on the other hand provides a…

A new definition for the Riemann zeta function for all positive integer number s > 1 is presented. We discover a most elegant expression and easy method for calculating the Riemann zeta function for small even integer values. Through this…

In this article, the 2-iterated Sheffer polynomials are introduced by means of generating function and operational representation. Using the theory of Riordan arrays and relations between the Sheffer sequences and Riordan arrays, a…

In this paper, we investigate the Bartholdi zeta function on a connected simple digraph with $n_V$ vertices and $n_E$ edges. We derive a functional equation for the Bartholdi zeta function $\zeta_G(q,u)$ on a regular graph $G$ with respect…

Inspired by the combinatorial constructions in earlier work of the authors that generalized the classical Alexander polynomial to a large class of spatial graphs with a balanced weight on edges, we show that the value of the Alexander…

For $\alpha \in [0,1]$, the $A_{\alpha}$-matrix of a graph $G$ is defined by $A_{\alpha}(G) = \alpha D(G) + (1- \alpha) A(G)$, where $A(G)$ and $D(G)$ denote the adjacency matrix and the diagonal degree matrix of $G$, respectively. In this…