Related papers: Combinatorics of the Dimer Model on a Strip
We express the finite 3D Dimer partition function as a linear combination of determinants of oriented adjacency matrices, and the finite 3D Ising partition sum as a linear combination of products over aperiodic closed walks. The methodology…
Partition functions for dimers on closed oriented surfaces are known to be alternating sums of Pfaffians of Kasteleyn matrices. In this paper, we obtain the formula for the coefficients in terms of discrete spin structures.
We study the dimer model for a planar bipartite graph N embedded in a disk, with boundary vertices on the boundary of the disk. Counting dimer configurations with specified boundary conditions gives a point in the totally nonnegative…
The combinatorial mutation of polygons, which transforms a given lattice polygon into another one, is an important operation to understand mirror partners for two-dimensional Fano manifolds, and the mutation-equivalent polygons give…
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…
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…
Graphs on surfaces is an active topic of pure mathematics belonging to graph theory. It has also been applied to physics and relates discrete and continuous mathematics. In this paper we present a formal mathematical description of the…
The classical 1961 solution to the problem of determining the number of perfect matchings (or dimer coverings) of a rectangular grid graph -- due independently to Kasteleyn and to Temperley and Fisher -- consists of changing the sign of…
In a previous paper, we showed how certain orientations of the edges of a graph G embedded in a closed oriented surface S can be understood as discrete spin structures on S. We then used this correspondence to give a geometric proof of the…
The connection between quiver gauge theories and dimer models has been well studied. It is known that the matter fields of the quiver gauge theories can be represented using the perfect matchings of the corresponding dimer model.We…
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…
We study the solutions of the T-system for type A, also known as the octahedron equation, viewed as a 2+1-dimensional discrete evolution equation. These may be expressed entirely in terms of the stepped surface over which the initial data…
We study asymptotics of the dimer model on large toric graphs. Let $\mathbb L$ be a weighted $\mathbb{Z}^2$-periodic planar graph, and let $\mathbb{Z}^2 E$ be a large-index sublattice of $\mathbb{Z}^2$. For $\mathbb L$ bipartite we show…
In this work, some classical results of the pfaffian theory of the dimer model based on the work of Kasteleyn, Fisher and Temperley are introduced in a fermionic framework. Then we shall detail the bosonic formulation of the model {\it via}…
We study various mathematical aspects of discrete models on graphs, specifically the Dimer and the Ising models. We focus on proving gluing formulas for individual summands of the partition function. We also obtain partial results regarding…
We study the classical dimer model on rhombic Penrose tilings, whose edges and vertices may be identified with those of a bipartite graph. We find that Penrose tilings do not admit perfect matchings (defect-free dimer coverings). Instead,…
Closed-form expressions are obtained for the generating function of close-packed dimers on a $2M \times 2N$ simple quartic lattice embedded on a M\"obius strip and a Klein bottle. Finite-size corrections are also analyzed and compared with…
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many heuristics have been proposed to partition models into few…
The partition function of the two-dimensional Ising model with zero magnetic field on a square lattice with m x n sites wrapped on a torus is computed within the transfer matrix formalism in an explicit step-by-step approach inspired by…
An isoradial graph is a planar graph in which each face is inscribable into a circle of common radius. We study the 2-dimensional perfect matchings on a bipartite isoradial graph, obtained from the union of an isoradial graph and its…