Related papers: Fermions and Zeta Function on the Graph
We investigate connected cubic vertex-transitive graphs whose edge sets admit a partition into a $2$-factor $\mathcal{C}$ and a $1$-factor that is invariant under a vertex-transitive subgroup of the automorphism group of the graph and where…
We examine the fundamental Kazakov-Migdal (FKM) model on a generic graph, whose partition function is represented by the Ihara zeta function weighted by unitary matrices. The FKM model becomes unstable in the critical strip of the Ihara…
Partition function of beta-gamma systems on the orbifolds C^2/Z_N and C^3/Z_M x Z_N are obtained as the invariant part of that on the respective affine spaces, by lifting the geometric action of the orbifold group to the fields.…
We propose a multipole representation of the Fermi-Dirac function and the Fermi operator, and use this representation to develop algorithms for electronic structure analysis of metallic systems. The new algorithm is quite simple and…
A general method of constructing the Dirac operator for a randomly triangulated manifold is proposed. The fermion field and the spin connection live, respectively, on the nodes and on the links of the corresponding dual graph. The…
We describe in detail a counterexample to the topological classification of free fermion systems. We deal with a one dimensional chain of Majorana fermions with an unusual T symmetry. The topological invariant for the free fermion…
The overlap formalism of chiral fermions provides a tool to measure the index, Q, of the chiral Dirac operator in a fixed gauge field background on the lattice. This enables a numerical measurement of the probability distribution, p(Q), in…
We study scalar and chiral fermionic models in next-to-leading order with the help of the functional renormalisation group. Their critical behaviour is of special interest in condensed matter systems, in particular graphene. To derive the…
A permutation graph is a cubic graph admitting a 1-factor M whose complement consists of two chordless cycles. Extending results of Ellingham and of Goldwasser and Zhang, we prove that if e is an edge of M such that every 4-cycle containing…
We present a formalism to calculate the orbital magnetization of interacting Dirac fermions under a magnetic field. In this approach, the divergence difficulty is overcome with a special limit of the derivative of the thermodynamic…
We study the dimer and Ising models on a finite planar weighted graph with periodic-antiperiodic boundary conditions, i.e. a graph $\Gamma$ in the Klein bottle $K$. Let $\Gamma_{mn}$ denote the graph obtained by pasting $m$ rows and $n$…
The Zero divisor Graph of a commutative ring $R$, denoted by $\Gamma[R]$, is a graph whose vertices are non-zero zero divisors of $R$ and two vertices are adjacent if their product is zero. Chemical graph theory is a branch of mathematical…
A proof of the Riemann hypothesis is proposed by relying on the properties of the Mellin transform. The function $\mathfrak{G}_{\eta}\left(t\right)$ is defined on the set $\bar{\mathbb{R}}_+$ of the non-negative real numbers, in term of a…
The enumeration of points on (or off) the union of some linear or affine subspaces over a finite field is dealt with in combinatorics via the characteristic polynomial and in algebraic geometry via the zeta function. We discuss the basic…
We construct wave functions and Dirac operator of spin $1/2$ fermions on quantum four-spheres. The construction can be achieved by the q-deformed differential calculus which is manifestly $SO(5)_q$ covariant. We evaluate the engenvalue of…
We construct a lattice Dirac operator of overlap type that describes the propagation of a Dirac fermion in an external gravitational field. The local Lorentz symmetry is manifestly realized as a lattice gauge symmetry, while it is believed…
We study a model of fully-packed dimer configurations (or perfect matchings) on a bipartite periodic graph that is two-dimensional but not planar. The graph is obtained from $\mathbb Z^2$ via the addition of an extensive number of extra…
Graph signal processing is an emerging field which aims to model processes that exist on the nodes of a network and are explained through diffusion over this structure. Graph signal processing works have heretofore assumed knowledge of the…
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…
The purpose of this article is to give an explicit description, in terms of hypergeometric functions over finite fields, of zeta function of a certain type of smooth hypersurfaces that generalizes Dwork family. The point here is that we…