Related papers: Dimer and fermionic formulations of a class of col…
In this paper, we introduce a novel and general method for computing partition functions of solvable lattice models with free fermionic Boltzmann weights. The method is based on the ``permutation graph'' and the ``$F$-matrix'': the…
We describe the general strategy for lifting the Wess-Zumino-Witten model from the level of one-loop Kac-Moody $U_q(\widehat{\mathfrak{g}})_k$ to generic quantum toroidal algebras. A nearly exhaustive presentation is given for the two…
We consider a lattice regularization, preserving Ward Identities (WI) and with a Wilson term, of the Massive QED$_2$, describing a fermion with mass $m$ and charge $\mathsf{e}$ interacting with a vector field with mass $M$, in the regime…
We explore the possibility of computing fermionic correlators on the lattice by combining a domain decomposition with a multi-level integration scheme. The quark propagator is expanded in series of terms with a well defined hierarchical…
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, and $L(G)$ be the line graph of $G$, which has vertex set $E(G)$ and two vertices $e$ and $f$ of $L(G)$ is adjacent if $e$ and $f$ is incident in $G$. The vertex-edge graph…
Since any fermionic operator \psi can be written as \psi=q+ip, where q and p are hermitian operators, we use the eigenvalues of q and p to construct a functional formalism for calculating matrix elements that involve fermionic fields. The…
Each partition $\lambda = (\lambda_1, \lambda_2, ..., \lambda_n)$ determines a so-called Ferrers tableau or, equivalently, a Ferrers bipartite graph. Its edge ideal, dubbed Ferrers ideal, is a squarefree monomial ideal that is generated by…
We examine the fermionic response in a holographic model of a low temperature striped phase, working for concreteness with the setup we studied in [Cremonini:2016rbd,Cremonini:2017usb], in which a U(1) symmetry and translational invariance…
We investigate integrable fermionic models within the scheme of the graded Quantum Inverse Scattering Method, and prove that any symmetry imposed on the solution of the Yang-Baxter Equation reflects on the constants of motion of the model;…
This paper studies the kernelization complexity of graph coloring problems with respect to certain structural parameterizations of the input instances. We are interested in how well polynomial-time data reduction can provably shrink…
In this paper we construct the exact representation of the Ising partition function in the form of the $ SL_q(2,R)$-invariant functional integral for the lattice free $(l,q)$-fermion field theory ($l=q=-1$). It is shown that the…
Ribbon graphs embedded on a Riemann surface provide a useful way to describe the double line Feynman diagrams of large N computations and a variety of other QFT correlator and scattering amplitude calculations, e.g in MHV rules for…
As a fundamental metric for quantifying quantum advantage in non-local games, the quantum chromatic number reveals the power of entanglement in distributed tasks. In this paper, we investigate this parameter for $q$-ary Hamming graphs and a…
In this paper we introduce and study a new problem named \emph{min-max edge $q$-coloring} which is motivated by applications in wireless mesh networks. The input of the problem consists of an undirected graph and an integer $q$. The goal is…
In this text we introduce and analyze families of symmetric functions arising as partition functions for colored fermionic vertex models associated with the quantized affine Lie superalgebra $U_q \big( \widehat{\mathfrak{sl}} (1 | n)…
We construct a Grassmann tensor network representing the partition function of (1+1)-dimensional two-color QCD with staggered fermions. The Grassmann path integral is rewritten as the trace of a Grassmann tensor network by introducing…
This paper is the first in the series devoted to evaluation of the partition function in statistical models on graphs with loops in terms of the Berezin/fermion integrals. The paper focuses on a representation of the determinant of a square…
This is a contribution to the number theory of the dimer problem. The number of dimer coverings (i.e., perfect matchings) of a square lattice graph is discussed modulo powers of 2.
Tensor networks provide a natural language for non-invertible symmetries in general Hamiltonian lattice models. We use ZX-diagrams, which are tensor network presentations of quantum circuits, to define a non-invertible operator implementing…
We provide first evidence that Matrix Models describe the low lying complex Dirac eigenvalues in a theory with dynamical fermions at non-zero density. Lattice data for gauge group SU(2) with staggered fermions are compared to detailed…