Packing dimers on $(2p+1)\times (2q+1)$ lattices

Abstract

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 (2k+1)$ \emph{odd} square lattices have some remarkable number-theoretical properties in parallel to those of close-packed dimers on $2k\times 2k$ \emph{even} square lattices, for which exact solution exists. Furthermore, we demonstrate that there is an unambiguous logarithm term in the finite size correction of free energy of odd-by-odd lattice strips with any width $n\ge 1$. This logarithm term determines the distinct behavior of the free energy of odd square lattices. These findings reveal a deep and previously unexplored connection between statistical physics models and number theory, and indicate the possibility that the monomer-dimer problem might be solvable.

20 pages, 7 figures

Cited by in corpus (9)

• Recursion-transform method on computing the complex resistor network with three arbitrary boundaries
• Dimer-monomer model on the Sierpinski gasket
• The Pfaffian solution of a dimer-monomer problem: Single monomer on the boundary
• Exact solution of the $2d$ dimer model: Corner free energy, correlation functions and combinatorics
• Exact finite-size corrections and corner free energies for the c=-2 universality class
• Exact finite-size corrections for the spanning-tree model under different boundary conditions
• Recurrence solution of monomer-polymer models on two-dimensional rectangular lattices
• State matrix recursion method and monomer--dimer problem
• Errata and Addenda to Mathematical Constants