Related papers: A generalized Ihara zeta function formula for simp…
In this paper, we deal with a generalization $\Gamma(\Omega,q)$ of the bipartite graphs $D(k,q)$ proposed by Lazebnik and Ustimenko, where $\Omega$ is a set of binary sequences that are adopted to index the entries of the vertices. A few…
This paper discusses the simplest examples of spectral zeta functions, especially those associated with graphs, a subject which has not been much studied. The analogy and the similar structure of these functions, such as their parallel…
The Ammann A2 tiling is a simple aperiodically ordered tiling of the plane. We consider the graph derived from this tiling, by treating each corner of each tile as a vertex and each side of each tile as an edge. We present a closed-form…
In this note, we provide several constructions of Deza Cayley graphs over groups having a generalized dihedral subgroup. These constructions are based on a usage of (relative) difference sets.
We formulate and prove a Gelfand-Levitan trace formula for general quantum graphs with arbitrary edge lengths and coupling conditions which cover all self-adjoint operators on quantum graphs, except for a set of measure zero. The formula is…
We introduce the \emph{chamber zeta function} for a complex of groups, defined via an Euler product over primitive tailless chamber galleries, extending the Ihara--Bass framework from weighted graphs to higher-rank settings. Let…
Let G be an arbitrary finite weighted digraph with weights in the set of complex rational functions. A general procedure is proposed which allows for the reduction of G to a smaller graph with a less complicated structure having the same…
Given any complex number $a$, we prove that there are infinitely many simple roots of the equation $\zeta(s)=a$ with arbitrarily large imaginary part. Besides, we give a heuristic interpretation of a certain regularity of the graph of the…
We introduce a new algorithm to compute the zeta function of a curve over a finite field. This method extends Kedlaya's algorithm to a very general class of curves using a map to the projective line. We develop all the necessary bounds,…
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…
In this paper, we introduce the normalized Shintani L-function of several variables by an integral representation and prove its functional equation. The Shintani L-function is a generalization to several variables of the Hurwitz-Lerch zeta…
The main objective of this paper is to obtain generalization of some Gruss-type inequalities in case of functional bounds by using a generalized Katugampola fractional integral.
In this article, we present a generalized Hecke's integral formula for an arbitrary extension $E/F$ of number fields. As an application, we present relative versions of the residue formula and Kronecker's limit formula for the "relative"…
In this paper, we establish some reciprocity formulas for certain generalized Hardy-Berndt sums by using the Fourier series technique and some properties of the periodic zeta function and the Lerch zeta function. It turns out that one of…
It is proved that for a vector space W, any set of parafermion-like vertex operators on W in a certain canonical way generates a generalized vertex algebra in the sense of [DL2] with W as a natural module. This result generalizes a result…
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 give an explicit formula for the well-known parity result for multiple zeta values as an application of the multitangent functions.
Estimating the average degree of graph is a classic problem in sublinear graph algorithm. Eden, Ron, and Seshadhri (ICALP 2017, SIDMA 2019) gave a simple algorithm for this problem whose running time depended on the graph arboricity, but…
Graph code is a linear code obtained from linear codes $C$ and a certain bipartite graph G. In this paper, I propose an expansion of the definition of graph code to general $l$-partite, and give its lower bound of minimum distance. I also…
We give an elementary combinatorial proof of Bass's determinant formula for the zeta function of a finite regular graph. This is done by expressing the number of non-backtracking cycles of a given length in terms of Chebychev polynomials in…