相关论文: The monopole-dimer model on high-dimensional cylin…

The monopole-dimer model is a signed variant of the monomer-dimer model which has determinantal structure. We extend the monopole-dimer model for planar graphs (Math. Phys. Anal. Geom., 2015) to Cartesian products thereof and show that the…

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…

The monopole-dimer model introduced recently is an exactly-solvable signed generalisation of the dimer model. We show that the partition function of the monopole-dimer model on a graph invariant under a fixed-point free involution is a…

The monomer-dimer model is fundamental in statistical mechanics. However, it is $#P$-complete in computation, even for two dimensional problems. A formulation in matrix permanent for the partition function of the monomer-dimer model is…

In this note, we give a closed formula for the partition function of the dimer model living on a (2 x n) strip of squares or hexagons on the torus for arbitrary even n. The result is derived in two ways, by using a Potts model like…

Given a weighted graph $G$ embedded in a non-orientable surface $\Sigma$, one can consider the corresponding weighted graph $\widetilde{G}$ embedded in the so-called orientation cover $\widetilde\Sigma$ of $\Sigma$. We prove identities…

We study the dimer and Ising models on a finite planar weighted graph with periodic-antiperiodic boundary conditions, i.e. a graph $\Gamma$ in the Klein bottle $K$. Let $\Gamma_{mn}$ denote the graph obtained by pasting $m$ rows and $n$…

The dimer model is a classical statistical mechanics model which is exactly solvable in two dimensions, but about which little is known in higher dimensions. In analogy with large $N$ limits in lattice gauge theory, we study a large $N$…

We consider the disordered monomer-dimer model on cylinder graphs $\mathcal{G}_n$, i.e., graphs given by the Cartesian product of the line graph on $n$ vertices, and a deterministic graph. The edges carry i.i.d. random weights, and the…

The main result of this paper is a Pfaffian formula for the partition function of the dimer model on a graph G embedded in a closed, possibly non-orientable surface S. This formula is suitable for computational purposes, and it is obtained…

We study the finite-size scaling properties of the Ising model on the Moebius strip and the Klein bottle. The results are compared with those of the Ising model under different boundary conditions, that is, the free, cylindrical, and…

We formulate a natural model of current loops and magnetic monopoles for arbitrary planar graphs, which we call the monopole-dimer model, and express the partition function of this model as a determinant. We then extend the method of…

The problem of enumerating dimers on an M x N net embedded on non-orientable surfaces is considered. We solve both the Moebius strip and Klein bottle problems for all M and N with the aid of imaginary dimer weights. The use of imaginary…

We present an application of the Grassmann algebra to the problem of the monomer-dimer statistics on a two-dimensional square lattice. The exact partition function, or total number of possible configurations, of a system of dimers with a…

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…

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…

We consider the monomer-dimer model on weighted graphs embedded in surfaces with boundary, with the restriction that only monomers located on the boundary are allowed. We give a Pfaffian formula for the corresponding partition function,…

The classical monomer-dimer model in two-dimensional lattices has been shown to belong to the \emph{``#P-complete''} class, which indicates the problem is computationally ``intractable''. We use exact computational method to investigate the…

We study classical hard-core dimer models on three-dimensional lattices using analytical approaches and Monte Carlo simulations. On the bipartite cubic lattice, a local gauge field generalization of the height representation used on the…

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…