Related papers: Exactly Solvable Lattice Models with Crossing Symm…
We discuss the hard-hexagon and hard-square problems, as well as the corresponding problem on the honeycomb lattice. The case when the activity is unity is of interest to combinatorialists, being the problem of counting binary matrices with…
We consider random perfect matchings on a general class of contracting bipartite graphs by letting certain edge weights be 0 on the contracting square-hexagon lattice in a periodic way. We obtain a deterministic limit shape in the scaling…
We solve a 4-(bond)-vertex model on an ensemble of 3-regular Phi3 planar random graphs, which has the effect of coupling the vertex model to 2D quantum gravity. The method of solution, by mapping onto an Ising model in field, is inspired by…
We consider the problem of approximating partition functions for Ising models. We make use of recent tools in combinatorial optimization: the Sherali-Adams and Lasserre convex programming hierarchies, in combination with variational methods…
We consider the coincidence problem for the square lattice that is translated by an arbitrary vector. General results are obtained about the set of coincidence isometries and the coincidence site lattices of a shifted square lattice by…
We show that the partition function of all classical spin models, including all discrete Standard Statistical Models and all abelian discrete Lattice Gauge Theories (LGTs), can be expressed as a special instance of the partition function of…
We propose a new second-order accurate lattice Boltzmann scheme that solves the quasi-static equations of linear elasticity in two dimensions. In contrast to previous works, our formulation solves for a single distribution function with a…
A recent simplified transfer matrix solution of the two-dimensional Ising model on a square lattice with periodic boundary conditions is generalized to periodic-antiperiodic, antiperiodic-periodic and antiperiodic-antiperiodic boundary…
We give a sequence of equivalent formulations of the $ADE$ and $\hat A\hat D\hat E$ height models defined on a random triangulated surface: random surfaces immersed in Dynkin diagrams, chains of coupled random matrices, Coulomb gases, and…
We present a version of the domino shuffling algorithm (due to Elkies, Kuperberg, Larsen and Propp) which works on a different lattice: the hexagonal lattice superimposed on its dual graph. We use our algorithm to count perfect matchings on…
Braiding matrices in rational conformal field theory are considered. The braiding matrices for any two block four point function are computed, in general, using the holomorphic properties of the blocks and the holomorphic properties of…
In this paper, we study the lattice properties of posets of torsion pairs in the module category of a family of representation-finite gentle algebras called tiling algebras, introduced by Coelho Simoes and Parsons. We present a…
The Ising model is an equilibrium stochastic process used as a model in several branches of science including magnetic materials, geophysics, neuroscience, sociology and finance. Real systems of interest have finite size and a fixed…
We construct two exactly soluble lattice spin models that demonstrate the importance of three-loop braiding statistics for the classification of 3D gapped quantum phases. The two models are superficially similar: both are gapped and both…
Simple cubic lattice (SC lattice) can be viewed as plane triangular lattice (PT lattice) by viewing it along its principle diagonal lines. By viewing thus we establish the exact one-to-one correspondence between the closed graphs on SC…
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is extended to the setting of general planar directed…
The perfect matching polytope, i.e. the convex hull of (incidence vectors of) perfect matchings of a graph is used in many combinatorial algorithms. Kotzig, Lov\'asz and Plummer developed a decomposition theory for graphs with perfect…
The exact partition function of the two-dimensional nearest neighbour Ising model pertaining to square lattices is derived for N sites in the case of a non-vanishing magnetic field.When the magnetic field is zero,the partition functions…
We construct a class of lattices in three and higher dimensions for which the number of dimer coverings can be determined exactly using elementary arguments. These lattices are a generalization of the two-dimensional kagome lattice, and the…
Partition functions, also known as homomorphism functions, form a rich family of graph invariants that contain combinatorial invariants such as the number of k-colourings or the number of independent sets of a graph and also the partition…