Related papers: Exactly Solvable Lattice Models with Crossing Symm…
Combining tree decomposition and transfer matrix techniques provides a very general algorithm for computing exact partition functions of statistical models defined on arbitrary graphs. The algorithm is particularly efficient in the case of…
There is no an exact solution to three-dimensional (3D) finite-size Ising model (referred to as the Ising model hereafter for simplicity) and even two-dimensional (2D) Ising model with non-zero external field to our knowledge. Here by using…
Certain mathematical structures make a habit of reoccuring in the most diverse list of settings. Some obvious examples exhibiting this intrusive type of behavior include the Fibonacci numbers, the Catalan numbers, the quaternions, and the…
Fully packed loop models describe the statistics of closely packed nested polygons on the square lattice. Many exact results can be obtained for these models, even for finite geometries, using their close relationship to alternating-sign…
The Grassmann path integral approach is used to calculate exact partition functions of the Ising model on MxN square (sq), plane triangular (pt) and honeycomb (hc) lattices with periodic-periodic (pp), periodic-antiperiodic (pa),…
In this paper we present exact calculations of the partition function $Z$ of the $q$-state Potts model and its generalization to real $q$, for arbitrary temperature on $n$-vertex strip graphs, of width $L_y=2$ and arbitrary length, of the…
Over the past few years it has been discovered that an "observable" can be set up on the lattice which obeys the discrete Cauchy-Riemann equations. The ensuing condition of discrete holomorphicity leads to a system of linear equations which…
Flow polytopes of acyclic oriented graphs arise naturally in combinatorial optimization, and the study of their volumes and triangulations has revealed intriguing connections across combinatorics, geometry, algebra, and representation…
We obtain off-critical (elliptic) Boltzmann weights for lattice models whose continuum limits correspond to massive, $N=2$ supersymmetric, quantum integrable field theories. We also compute the free energies of these models and show that…
A new and efficient algorithm is presented for the calculation of the partition function in the $S=\pm 1$ Ising model. As an example, we use the algorithm to obtain the thermal dependence of the magnetic spin susceptibility of an Ising…
We present a detailed description of the essentially entropic lattice Boltzmann model. The entropic lattice Boltzmann model guarantees unconditional numerical stability by iteratively solving the nonlinear entropy evolution equation. In…
We show that the two dimensional Ising model is complete, in the sense that the partition function of any lattice model on any graph is equal to the partition function of the 2D Ising model with complex coupling. The latter model has all…
This paper introduces a new method for the efficient computation of oscillatory multidimensional lattice sums in geometries with boundaries. Such sums are ubiquitous in both pure and applied mathematics, and have immediate applications in…
A free boson on a lattice is the simplest field theory one can think of. Its partition function can be easily computed in momentum space. However, this straightforward solution hides its integrability properties. Here, we use the methods of…
We define and study noncommutative crossing partitions which are a generalization of non-crossing partitions. By introducing a new cover relation on binary trees, we show that the partially ordered set of noncommutative crossing partitions…
We investigate the tractability of a simple fusion of two fundamental structures on graphs, a spanning tree and a perfect matching. Specifically, we consider the following problem: given an edge-weighted graph, find a minimum-weight…
We construct colored lattice models whose partition functions represent symplectic and odd orthogonal Demazure characters and atoms. We show that our lattice models are not solvable, but we are able to show the existence of sufficiently…
The partition function of the O(n) loop model on the honeycomb lattice is mapped to that of the O(n) loop model on the 3-12 lattice. Both models share the same operator content and thus critical exponents. The critical points are related…
In this paper we construct a three-dimensional (3D) solvable lattice model with non-negative Boltzmann weights. The spin variables in the model are assigned to edges of the 3D cubic lattice and run over an infinite number of discrete…
The spin-1/2 Ising model on the bow-tie lattice is exactly solved by establishing a precise mapping relationship with its corresponding free-fermion eight-vertex model. Ground-state and finite-temperature phase diagrams are obtained for the…