Related papers: Vertex-Face/Zeta correspondence

Our previous works presented zeta functions by the Konno-Sato theorem or the Fourier analysis for one-particle models including random walks, correlated random walks, quantum walks, and open quantum random walks. This paper introduces a new…

This paper focuses on identifying vertex characteristics in 2D images using topological asymptotic analysis. Vertex characteristics include both the location and the type of the vertex, with the latter defined by the number of lines forming…

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…

Starting from a finite simple graph $G$, for each eigenvalue $\theta$ of its adjacency matrix one can construct a convex polytope $P_G(\theta)$, the so called $\theta$-eigenpolytop of $G$. For some polytopes this technique can be used to…

The phase diagram for a two-dimensional self-avoiding walk model on the square lattice incorporating attractive short-ranged interactions between parallel sections of walk is derived using numerical transfer matrix techniques. The model…

Stark and Terras introduced the edge zeta function of a finite graph in 1996. The edge zeta function is the reciprocal of a polynomial in twice as many variables as edges in the graph and can be computed in polynomial time. We look at graph…

We give the characteristic polynomial of the distance or adjacency matrix of the strong power graph of a finite group, and compute its distance and adjacency spectrum.

The purpose of this paper is to investigate coefficient matrices of functional equations of zeta functions associated with homogeneous cones, which are given explicitly in the previous paper, in detail. We prove that the coefficient matrix…

I give a formula for the zeta function of a projective toric hypersurface over a finite field and estimate its Newton polygon. As an application this formula allows us to compute the exact number of rational points on the families of…

If a map has k transitivity classes of vertices that are subject to the action of the automorphism group, it is said to be k-uniform. The classification of 1-uniform maps on the torus is known. In this article, we classify 2-uniform maps on…

Recently, the quaternionic quantum walk was formulated by the first author as a generalization of discrete-time quantum walks. We treat the right eigenvalue problem of quaternionic matrices to analysis the spectra of its transition matrix.…

Recently, the staggered quantum walk (SQW) on a graph is discussed as a generalization of coined quantum walks on graphs and Szegedy walks. We present a formula for the time evolution matrix of a 2-tessellable SQW on a graph, and so…

We classify trivalent vertex-transitive graphs whose edge sets have a partition into a 2-factor composed of two cycles and a 1-factor that is invariant under the action of the automorphism group.

We determine the zeta functions of trinomial curves in terms of Gauss sums and Jacobi sums, and we obtain an explicit formula of the genus of a trinomial curve over a finite field, then we study the conditions for a trinomial curve to be a…

The 6-vertex model is a seminal model for many domains in Mathematics and Physics. The sets of configurations of the 6-vertex model can be described as the sets of paths in multigraphs. In this article the transition probability of the…

Transfer matrix method is a well-known and extensively used tool to compute the reflection and transmission coefficients of electromagnetic waves when interacting with a system of layers parallel to each other. We present here a modified…

In a previous paper the authors elaborated notions and technique which could be applied to compute such invariants of polynomials as Euler characteristics of fibres and zeta-functions of monodromy transformations associated with a…

Let $G$ be a graph with vertex set $V=\{v_{1},\dots,v_{n}\}$ and adjacency matrix $A.$ For a subset $S$ of $V$ let $\e=(x_{1},\,\dots,\,x_{n})^{\tt T}$ be the characteristic vector of $S,$ that is, $x_{\ell}=1$ if $v_{\ell}\in S$ and…

In this article, we study eigenvalue functions of varying transition probability matrices on finite, vertex transitive graphs. We prove that the eigenvalue function of an eigenvalue of fixed higher multiplicity has a critical point if and…

In this work we provide a novel approach for computing the coefficients of the characteristic polynomial of a square matrix. We demonstrate that each coefficient can be efficiently represented by a set of circle graphs. Thus, one can employ…