A Reciprocity Theorem for Monomer-Dimer Coverings

We consider close-packed dimers, or perfect matchings, on two-dimensional regular lattices. We review known results and derive new expressions for the free energy, entropy, and the molecular freedom of dimers for a number of lattices including the simple-quartic (4^4), honeycomb (6^3), triangular (3^6), kagome (3.6.3.6), 3-12 (3.12^2) and its dual [3.12^2], and 4-8 (4.8^2) and its dual Union Jack [4.8^2] Archimedean tilings. The occurrence and nature of phase transitions are ...

In this paper we review the asymptotic matching conjectures for $r$-regular bipartite graphs, and their connections in estimating the monomer-dimer entropies in $d$-dimensional integer lattice and Bethe lattices. We prove new rigorous upper and lower bounds for the monomer-dimer entropies, which support these conjectures. We describe a general construction of infinite families of $r$-regular tori graphs and give algorithms for computing the monomer-dimer entropy of density $p...

A seminal milestone in lattice statistics is the exact solution of the enumeration of dimers on a simple-quartic net obtained by Fisher,Kasteleyn, and Temperley (FKT) in 1961. An outstanding related and yet unsolved problem is the enumeration of dimers on a net with vacant sites. Here we consider this vacant-site problem with a single vacancy occurring at certain specific sites on the boundary of a simple-quartic net. First, using a bijection between dimer and spanning tree c...

We derive self-reciprocity properties for a number of polyomino generating functions, including several families of column-convex polygons, three-choice polygons and staircase polygons with a staircase hole. In so doing, we establish a connection between the reciprocity results known to combinatorialists and the inversion relations used by physicists to solve models in statistical mechanics. For several classes of convex polygons, the inversion (reciprocity) relation, augment...

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 proposed in this paper, by transforming the number of all matchings of a bipartite graph into the number of perfect matchings of an extended bipartite graph, which can be given by a matrix permanent. Sequential importance sampling algorithm is ...

In this paper we determine the interaction of diagonal defect clusters in regions of an Aztec rectangle that scale to arbitrary points on its symmetry axis (in earlier work we treated the case when this point was the center of the scaled Aztec rectangle). We use the resulting formulas to determine the asymptotics of the correlation of defects that are macroscopically separated from one another and feel the influence of the boundary. In several of the treated situations this s...

In these lecture notes we present some connections between random matrices, the asymmetric exclusion process, random tilings. These three apparently unrelated objects have (sometimes) a similar mathematical structure, an interlacing structure, and the correlation functions are given in terms of a kernel. In the basic examples, the kernel is expressed in terms of orthogonal polynomials.

We present some promising ideas to treat the problem of making completely rigorous the development of our expression for $\lambda_d(p)$ of the monomer-dimer problem on a $d$-dimensional hypercubic lattice \begin{equation}\label{abstract1} \lambda_d(p)=\frac{1}{2}\Big(p\ln(2d)-p\ln(p)-2(1-p)\ln(1-p)-p\Big) +\sum_{k=2}a_k(d)p^k \end{equation} where $a_k(d)$ is a sum of powers $(1/d)^r$ for \begin{equation}\label{abstract2} k-1\leq r\leq k/2 \end{equation} In fact as we wi...

We discuss the problem to count, or, more modestly, to estimate the number f(m,n) of unimodular triangulations of the planar grid of size $m\times n$. Among other tools, we employ recursions that allow one to compute the (huge) number of triangulations for small m and rather large n by dynamic programming; we show that this computation can be done in polynomial time if m is fixed, and present computational results from our implementation of this approach. We also present ...

We discuss some diverse open problems in the dimer model, motivated by a geometric viewpoint. This is part of a conference proceedings for the OPAC 2022 conference.