Search arXivSearch

arXiv · 2408.04952

Functional Equations and Pole Structure of the Bartholdi Zeta Function

Abstract

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 $ζ_G(q,u)$ on a regular graph $G$ with respect to the bump parameter $u$. We also find an equivalence between the Bartholdi zeta function with a specific value of $u$ and the Ihara zeta function at $u=0$. We determine bounds of the critical strip of $ζ_G(q,u)$ for a general graph. If $G$ is a $(t+1)$-regular graph, the bounds are saturated and $q=(1-u)^{-1}$ and $q=(t+u)^{-1}$ are the poles at the boundaries of the critical strip for $u\ne 1, -t$. When $G$ is the regular graph and the spectrum of the adjacency matrix satisfies a certain condition, $ζ_G(q,u)$ satisfies the so-called Riemann hypothesis. For $u \ne 1$, $q=\pm(1-u)^{-1}$ are poles of $ζ_G(q,u)$ unless $G$ is tree. Although the order of the pole at $q=(1-u)^{-1}$ is $n_E-n_V+1$ if $u\ne u_* \equiv 1-\frac{n_E}{n_V}$, it is enhanced at $u=u_*$. In particular, if the Moore-Penrose inverse of the incidence matrix $L^+$ and the degree vector $\vec{d}$ satisfy the condition $|L^+ \vec{d}|^2\ne n_E$, the order of the pole at $q=(1-u)^{-1}$ increases only by one at $u=u_*$. The order of the pole at $q=-(1-u)^{-1}$ coincides with that at $q=(1-u)^{-1}$ if $G$ is bipartite and is $n_E-n_V$ otherwise.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

So Matsuura, Kazutoshi Ohta. 2024-08-09. Functional Equations and Pole Structure of the Bartholdi Zeta Function. https://arxiv.org/abs/2408.04952

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO