ID: math/0608229

Ihara's zeta function for periodic graphs and its approximation in the amenable case

August 9, 2006

View on ArXiv

Similar papers 4

Graphs and Generalized Witt identities

September 19, 2014

81% Match
Costa G. A. T. F. da
Combinatorics

This paper is about the determinantal identities associated with the Ihara (Ih) zeta function of a non directed graph and the Bowen-Lanford (BL) zeta function of a directed graph. They will be called the Ih and the BL identities in this paper. We show that the Witt identity (WI) is a special case of the BL identity and inspired by the links the WI has with Lie algebras and combinatorics we investigate similar aspects of the Ih and BL identities. We show that they satisfy gene...

Find SimilarView on arXiv

Graph Zeta Functions and Wilson Loops in Kazakov-Migdal Model

August 30, 2022

81% Match
So Matsuura, Kazutoshi Ohta
Mathematical Physics

In this paper, we consider an extended Kazakov-Migdal model defined on an arbitrary graph. The partition function of the model, which is expressed as the summation of all Wilson loops on the graph, turns out to be represented by the Bartholdi zeta function weighted by unitary matrices on the edges of the graph. The partition function on the cycle graph at finite $N$ is expressed by the generating function of the generalized Catalan numbers. The partition function on an arbitr...

Find SimilarView on arXiv

Edge reconstruction of the Ihara zeta function

July 13, 2015

81% Match
Gunther with an appendix by Daniel McDonald Cornelissen, Janne with an appendix by Daniel McDonald Kool
Combinatorics
Number Theory

We show that if a graph $G$ has average degree $\bar d \geq 4$, then the Ihara zeta function of $G$ is edge-reconstructible. We prove some general spectral properties of the edge adjacency operator $T$: it is symmetric for an indefinite form and has a "large" semi-simple part (but it can fail to be semi-simple in general). We prove that this implies that if $\bar d>4$, one can reconstruct the number of non-backtracking (closed or not) walks through a given edge, the Perron-Fr...

Find SimilarView on arXiv

Ihara zeta function, coefficients of Maclaurin series, and Ramanujan graphs

May 31, 2019

81% Match
Hau-Wen Huang
Combinatorics

Let $X$ denote a connected $(q+1)$-regular undirected graph of finite order $n$. The graph $X$ is called Ramanujan whenever $$ |\lambda|\leq 2q^{\frac{1}{2}} $$ for all nontrivial eigenvalues $\lambda$ of $X$. We consider the variant $\Xi(u)$ of the Ihara zeta function $Z(u)$ of $X$ defined by \begin{gather*} \Xi(u)^{-1} = \left\{ \begin{array}{ll} (1-u)(1-qu)(1-q^{\frac{1}{2}} u)^{2n-2}(1-u^2)^{\frac{n(q-1)}{2}} Z(u) \qquad &\hbox{if $X$ is nonbipartite}, (1-q^...

Find SimilarView on arXiv

Special values of spectral zeta functions of graphs and Dirichlet L-functions

December 28, 2022

81% Match
Bing Xie, Yigeng Zhao, Yongqiang Zhao
Number Theory

In this paper, we establish relations between special values of Dirichlet $L$-functions and that of spectral zeta functions or $L$-functions of cycle graphs. In fact, they determine each other in a natural way. These two kinds of special values were bridged together by a combinatorial derivative formula obtained from studying spectral zeta functions of the first order self-adjoint differential operators on the unit circle.

Find SimilarView on arXiv

Approximating Spectral invariants of Harper operators on graphs

June 20, 2000

81% Match
V. University of Adelaide Mathai, S. University of Adelaide Yates
Functional Analysis

We study Harper operators and the closely related discrete magnetic Laplacians (DML) on a graph with a free action of a discrete group, as defined by Sunada. A main result in this paper is that the spectral density function of DMLs associated to rational weight functions on graphs with a free action of an amenable discrete group, can be approximated by the average spectral density function of the DMLs on a regular exhaustion, with either Dirichlet or Neumann boundary conditio...

Find SimilarView on arXiv

Algebraic combinatorics on trace monoids: extending number theory to walks on graphs

January 8, 2016

81% Match
P. -L LMJL Giscard, P LMJL Rochet
Combinatorics

Partially commutative monoids provide a powerful tool to study graphs, viewingwalks as words whose letters, the edges of the graph, obey a specific commutation rule. A particularclass of traces emerges from this framework, the hikes, whose alphabet is the set of simple cycleson the graph. We show that hikes characterize undirected graphs uniquely, up to isomorphism, andsatisfy remarkable algebraic properties such as the existence and uniqueness of a prime factorization.Becaus...

Find SimilarView on arXiv

Stratified Ehrhart ring theory on periodic graphs

October 30, 2023

80% Match
Takuya Inoue, Yusuke Nakamura
Combinatorics
Commutative Algebra

We investigate the "stratified Ehrhart ring theory" for periodic graphs, which gives an algorithm for determining the growth sequences of periodic graphs. The growth sequence $(s_{\Gamma, x_0, i})_{i \ge 0}$ is defined for a graph $\Gamma$ and its fixed vertex $x_0$, where $s_{\Gamma, x_0, i}$ is defined as the number of vertices of $\Gamma$ at distance $i$ from $x_0$. Although the sequences $(s_{\Gamma, x_0, i})_{i \ge 0}$ for periodic graphs are known to be of quasi-polynom...

Find SimilarView on arXiv

Graph Zeta Function and Gauge Theories

February 7, 2011

80% Match
Yang-Hui He
Mathematical Physics

Along the recently trodden path of studying certain number theoretic properties of gauge theories, especially supersymmetric theories whose vacuum manifolds are non-trivial, we investigate Ihara's Graph Zeta Function for large classes of quiver theories and periodic tilings by bi-partite graphs. In particular, we examine issues such as the spectra of the adjacency and whether the gauge theory satisfies the strong and weak versions of the graph theoretical analogue of the Riem...

Find SimilarView on arXiv

Finite pseudo orbit expansions for spectral quantities of quantum graphs

May 18, 2012

80% Match
Ram Band, Jonathan M. Harrison, Christopher H. Joyner
Mathematical Physics

We investigate spectral quantities of quantum graphs by expanding them as sums over pseudo orbits, sets of periodic orbits. Only a finite collection of pseudo orbits which are irreducible and where the total number of bonds is less than or equal to the number of bonds of the graph appear, analogous to a cut off at half the Heisenberg time. The calculation simplifies previous approaches to pseudo orbit expansions on graphs. We formulate coefficients of the characteristic polyn...

Find SimilarView on arXiv