相关论文: Exact Solution of a Monomer-Dimer Problem: A Singl…
We consider the dimer-monomer problem for the rectangular lattice. By mapping the problem into one of close-packed dimers on an extended lattice, we rederive the Tzeng-Wu solution for a single monomer on the boundary by evaluating a…
We present analytic results for a special dimer model on the {\em non-bipartite} and {\em non-planar} checkerboard lattice that does not allow for parallel dimers surrounding diagonal links. We {\em exactly} calculate the number of closed…
The correlation functions of an arbitrary number of boundary monomers in the system of close-packed dimers on the square lattice are computed exactly in the scaling limit. The equivalence of the 2n-point correlation functions with those of…
Using exact computations we study the classical hard-core monomer-dimer models on m x n plane lattice strips with free boundaries. For an arbitrary number v of monomers (or vacancies), we found a logarithmic correction term in the…
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 the finite-size corrections of the dimer model on $\infty \times N$ square lattice with two different boundary conditions: free and periodic. We find that the finite-size corrections in a crucial way depend on the parity of $N$; we…
We consider (a) the partition functions of the anisotropic dimer model on the rectangular (2M-1) x (2N-1) lattice with free and cylindrical boundary conditions with a single monomer residing on the boundary and (b) the partition function of…
We study the classical hard-core dimer model on the triangular lattice. Following Kasteleyn's fundamental theorem on planar graphs, this problem is soluble by Pfaffians. This model is particularly interesting for, unlike the dimer problems…
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…
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…
We use computational method to investigate the number of ways to pack dimers on \emph{odd-by-odd} lattices. In this case, there is always a single vacancy in the lattices. We show that the dimer configuration numbers on $(2k+1) \times…
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 discuss the exact solutions of various models of the statistics of dimer coverings of a Bethe lattice. We reproduce the well-known exact results for noninteracting hard-core dimers by both a very simple geometrical argument and a general…
The problem of counting polymer coverings on the rectangular lattices is investigated. In this model, a linear rigid polymer covers $k$ adjacent lattice sites such that no two polymers occupy a common site. Those unoccupied lattice sites…
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 write exact equations for the thermodynamic properties of a linear polymer molecule confined to walk on a lattice of finite size. The dimension of the space in which the lattice resides can be arbitrary. We also calculate polymer…
The decades-long search for a shape that tiles the plane only aperiodically under translations and rotations recently ended with the discovery of the `spectre' aperiodic monotile. In this setting we study the dimer model, in which dimers…
The exact enumeration of pure dimer coverings on the square lattice was obtained by Kasteleyn, Temperley and Fisher in 1961. In this paper, we consider the monomer-dimer covering problem (allowing multiple monomers) which is an outstanding…
It is well-known that exact enumerations of close-packed dimers can be carried out for two-dimensional lattices. While details of results are now known for most lattices, due to the unique nature of the lattice structure, there has been no…
We define the matching measure of a lattice L as the spectral measure of the tree of self-avoiding walks in L. We connect this invariant to the monomer-dimer partition function of a sequence of finite graphs converging to L. This allows us…