Related papers: Dimer and fermionic formulations of a class of col…
We show that the fermionic matrix model can be realized by $W$-representation. We construct the Virasoro constraints with higher algebraic structures, where the constraint operators obey the Witt algebra and null 3-algebra. The remarkable…
This note relates topics in statistical mechanics, graph theory and combinatorics, lattice quantum field theory, super quantum mechanics and string theory. We give a precise relation between the dimer model on a graph embedded on a torus…
A fermionic supersymmetric extension is established for the Gauss-Weingarten and Gauss-Codazzi equations describing conformally parametrized surfaces immersed in a Grassmann superspace. An analysis of this extension is performed using a…
The number of proper $q$-colorings of a graph $G$, denoted by $P_G(q)$, is an important graph parameter that plays fundamental role in graph theory, computational complexity theory and other related fields. We study an old problem of Linial…
We construct a lattice kinetic scheme to study electronic flow in graphene. For this purpose, we first derive a basis of orthogonal polynomials, using as weight function the ultrarelativistic Fermi-Dirac distribution at rest. Later, we use…
Fermionic formulae originate in the Bethe ansatz in solvable lattice models. They are specific expressions of some q-polynomials as sums of products of q-binomial coefficients. We consider the fermionic formulae associated with general…
We present the fermionic representation for the q-deformed hypergeometric functions related to Schur polynomials considered by S.Milne \cite{Milne}. For $q=1$ these functions are also known as hypergeometric functions of matrix argument…
The strongly correlated fermions play a vital role in modern physics. For a given fermionic Hamiltonian system, the most widely used approach to explore the underlying physics is to study the wave function that incorporates Fermi-Dirac…
The arithmetic of N, Z, Q, R can be extended to a graph arithmetic where N is the semiring of finite simple graphs and where Z and Q are integral domains, culminating in a Banach algebra R. A single network completes to the Wiener algebra.…
Lattice gauge theories of permutation groups with a simple topological action (henceforth permutation-TFTs) have recently found several applications in the combinatorics of quantum field theories (QFTs). They have been used to solve…
The sign problem is a major obstacle to our understanding of the phase diagram of QCD at finite baryon density. Several numerical methods have been proposed to tackle this problem, but a full solution to the sign problem is still elusive.…
For integer q>1, we derive edge q-colouring models for (i) the Tutte polynomial of a graph G on the hyperbola H_q, (ii) the symmetric weight enumerator of the set of group-valued q-flows of G, and (iii) a more general vertex colouring model…
We consider proper colorings of planar graphs embedded in the annulus, such that vertices on one rim can take Q_s colors, while all remaining vertices can take Q colors. The corresponding chromatic polynomial is related to the partition…
We discuss the notion of s-embeddings $\mathcal{S}=\mathcal{S}_\mathcal{X}$ of planar graphs carrying a nearest-neighbor Ising model. The construction of $\mathcal{S}_\mathcal{X}$ is based upon a choice of a global complex-valued solution…
We give a descriptive review of the Fermionic basis approach to the theory of correlation functions of the XXZ quantum spin chain. The emphasis is on explicit formulae for short-range correlation functions which will be presented in a way…
Vizing's theorem states that every simple undirected graph can be edge-colored using fewer than $\Delta + 1$ colors, where $\Delta$ is the graph's maximum degree. The original proof was given through a polynomial-time algorithmic procedure…
In this we give a detailed proof of fermionic p-adic q-measures on Z_p and we will treat some interesting formulae related q-extension of Euler numbers and polynomials.
We study two weighted graph coloring problems, in which one assigns $q$ colors to the vertices of a graph such that adjacent vertices have different colors, with a vertex weighting $w$ that either disfavors or favors a given color. We…
The \emph{Square Colouring} of a graph $G$ refers to colouring of vertices of a graph such that any two distinct vertices which are at distance at most two receive different colours. In this paper, we initiate the study of a related…
The functional integral representation for fermionic observables on the lattice is studied. In particular, Grassmannian representations of the scalar $\hatJ^{(S)}$ and pseudoscalar $\hatJ^{(P)}$ currents and pseudoscalar correlator are…