Related papers: Exactly Solvable Lattice Models with Crossing Symm…
We present a method for calculating transfer matrices for the $q$-state Potts model partition functions $Z(G,q,v)$, for arbitrary $q$ and temperature variable $v$, on cyclic and M\"obius strip graphs $G$ of the square (sq), triangular…
We have developed a tensor network approach to the two-dimensional fully frustrated classical XY spin model on the kagome lattice, and clarified the nature of the possible phase transitions of various topological excitations.We find that…
In this paper we propose an algorithm for exact partitioning of high-order models. We define a general class of $m$-degree Homogeneous Polynomial Models, which subsumes several examples motivated from prior literature. Exact partitioning…
Using the Boltzmann weights of classical Statistical Mechanics vertex models we define a new class of Tensor Product Ansatzs for 2D quantum lattice systems, characterized by a strong anisotropy, which gives rise to stripe like structures.…
An efficient scheme to compute the geometric entanglement per lattice site for quantum many-body systems on a periodic finite-size chain is proposed in the context of a tensor network algorithm based on the matrix product state…
We study an exactly solvable quantum field theory (QFT) model describing interacting fermions in 2+1 dimensions. This model is motivated by physical arguments suggesting that it provides an effective description of spinless fermions on a…
Exact solutions of interacting random walk models, such as 1D lattice gases, offer precise insight into the origin of nonequilibrium phenomena. Here, we study a model of run-and-tumble particles on a ring lattice interacting via hardcore…
We define an infinite class of ``frustration-free'' interacting lattice quantum Hamiltonians for bosons, constructed such that their exact ground states have a density distribution specified by the Boltzmann weight of a corresponding…
We show how to construct lattice sigma models in one, two and four dimensions which exhibit an exact fermionic symmetry. These models are discretized and {\it twisted} versions of conventional supersymmetric sigma models with N=2…
The set of all perfect matchings of a plane (weakly) elementary bipartite graph equipped with a partial order is a poset, moreover the poset is a finite distributive lattice and its Hasse diagram is isomorphic to $Z$-transformation directed…
We study a three-dimensional (3D) classical Ising model that is exactly solvable when some coupling constants take certain imaginary values. The solution combines and generalizes the Onsager-Kaufman solution of the 2D Ising model and the…
We introduce in this paper an exact solvable BCS-Hubbard model in arbitrary dimensions. The model describes a p-wave BCS superconductor with equal spin pairing moving on a bipartite (cubic, square etc.) lattice with on site Hubbard…
We study the approximation complexity of the partition function of the eight-vertex model on general 4-regular graphs. For the first time, we relate the approximability of the eight-vertex model to the complexity of approximately counting…
An exact algorithm is presented for solving edge weighted graph partitioning problems. The algorithm is based on a branch and bound method applied to a continuous quadratic programming formulation of the problem. Lower bounds are obtained…
The evaluation of partition functions is a central problem in statistical physics. For lattice systems and other discrete models the partition function may be expressed as the contraction of a tensor network. Unfortunately computing such…
We call a lattice crosscut-simplicial if the crosscut complex of every atomic interval is equal to the boundary of a simplex. Every interval of such a lattice is either contractible or homotopy equivalent to a sphere. Recently, Hersh and…
For any finite Coxeter group $W$ of rank $n$ we show that the order complex of the lattice of non-crossing partitions $\mathrm{NC}(W)$ embeds as a connected chamber subcomplex into a spherical building of type $A_{n-1}$. We use this to give…
We present an efficient quantum algorithm for the exact evaluation of either the fully ferromagnetic or anti-ferromagnetic q-state Potts partition function Z for a family of graphs related to irreducible cyclic codes. This problem is…
We introduce and study the lattice of generalized partitions, called weighted partitions. This lattice possesses similar properties of the lattice of partitions. By use of the pictorial representation of a weighted partition, the total…
Recent numerical studies of the susceptibility of the three-dimensional Ising model with various interaction ranges have been analyzed with a crossover model based on renormalization-group matching theory. It is shown that the model yields…