Exact solution of close-packed dimers on the kagome lattice

Abstract

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 complete analysis for the kagome lattice. Here we derive the close-form expression $(1/3)\ln (4xyz)$ for the free energy of close-packed dimers on the kagome lattice, where $x,y,z$ are dimer weights. We use two different approaches, the Kasteleyn method of evaluating a Pfaffian and an alternative vertex model formulation. Both methods lead to the same final expression. The correlation function between two dimers at a distance equal or greater than two lattice spacings is found to vanish identically.

4 pages, 4 figures, RevTex4, two column, published version, removed section of asymmetric model, added details about dimer correlation

References in corpus (3)

• Spin Dynamics of the Spin-1/2 Kagome Lattice Antiferromagnet ZnCu_3(OH)_6Cl_2
• Quantum magnetism in the paratacamite family: towards an ideal kagome lattice
• Spin Liquid States on the Triangular and Kagome Lattices: A Projective Symmetry Group Analysis of Schwinger Boson States

Cited by in corpus (10)

• Exact solution of the $2d$ dimer model: Corner free energy, correlation functions and combinatorics
• Dimers on the Triangular Kagome Lattice
• Statistical mechanics of dimers on quasiperiodic Ammann-Beenker tilings
• Close-packed dimers on the kagome lattice: Finite lattices and the Grassmannian approach
• Exact entropy of dimer coverings for a class of lattices in three or more dimensions
• Tensor renormalization group approach to classical dimer models
• Exact Results for the Residual Entropy of Ice Hexagonal Monolayer
• Free-fermion models and the two-dimensional Ising models under the zero field and imaginary field $i(\pi /2)k_{B}T$
• Perfect matchings of line graphs with small maximum degree
• Solving the dimer problem of the vertex-edge graph of a cubic graph