Related papers: Dimers on two-dimensional lattices
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 study perfect matchings, or close-packed dimer coverings, of finite sections of the eleven Archimedean lattices and give a constructive proof showing that any two perfect matchings can be transformed into each other using small sets of…
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…
Exact analyses are given for two three-dimensional lattice systems: A system of close-packed dimers placed in layers of honeycomb lattices and a layered triangular-lattice interacting domain wall model, both with nontrivial interlayer…
A model is presented consisting of triangular trimers on the triangular lattice. In analogy to the dimer problem, these particles cover the lattice completely without overlap. The model has a honeycomb structure of hexagonal cells separated…
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…
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…
In a recent paper [ F. Wang and F. Y. Wu, Phys. Rev. E 75 (2007) 040105(R) ] we reported exact results on the enumeration of close-packed dimers on an infinite kagome lattice. We computed the per-dimer free energy using both the Pfaffian…
This is a contribution to the number theory of the dimer problem. The number of dimer coverings (i.e., perfect matchings) of a square lattice graph is discussed modulo powers of 2.
We consider the number of ways all the sites of a kagome lattice can be covered by non-overlapping linear rigid rods where each rod covers 3 sites. We establish a 2-to-1 correspondence between the configurations of trimers on the kagome…
We map certain highly correlated electron systems on lattices with geometrical frustration in the motion of added particles or holes to the spatial defect-defect correlations of dimer models in different geometries. These models are studied…
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 introduce quantum dimer models on lattices made of corner-sharing triangles. These lattices includes the kagome lattice and can be defined in arbitrary geometry. They realize fully disordered and gapped dimer-liquid phase with…
In this paper, we investigate if it occurs a phase transition for a system of classical dimers adsorbed on a 3-4 lattice in the thermodynamic limit. We define four types of bonds (denoted by the dimers activities adsorbed in her, $x$, $y$,…
We consider local dynamics of the dimer model (perfect matchings) on hypercubic boxes $[n]^d$. These consist of successively switching the dimers along alternating cycles of prescribed (small) lengths. We study the connectivity properties…
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,…
The problem of close-packed dimers on the honeycomb lattice was solved by Kasteleyn in 1963. Here we extend the solution to include interactions between neighboring dimers in two spatial lattice directions. The solution is obtained by using…
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…
We derive exact results for close-packed dimers on the triangular kagome lattice (TKL), formed by inserting triangles into the triangles of the kagome lattice. Because the TKL is a non-bipartite lattice, dimer-dimer correlations are…
In the monomer-polymer model, a linear rigid polymer covers $k$ adjacent lattice sites, with no lattice site occupied by more than one polymer. The polymers are called $k$-mers, and those unoccupied lattice sites are called monomers. The…