Recurrence solution of monomer-polymer models on two-dimensional rectangular lattices

Abstract

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 are considered as monomers. We prove that for a given number of polymers ($k$-mers), the number of arrangements for the polymers on two-dimensional rectangular lattices satisfies simple recurrence relations. These recurrence relations are quite general and apply for arbitrary polymer length ($k$) and the width of the lattices ($n$). The well-studied monomer-dimer problem is a special case of the monomer-polymer model when $k=2$. It is known the enumeration of monomer-dimer configurations in planar lattices is #P-complete. The recurrence relations shown here have the potential for hints for the solution of long-standing problems in this class of computational complexity.

References in corpus (11)

• On the orientational ordering of long rods on a lattice
• Logarithmic Conformal Field Theory and Boundary Effects in the Dimer Model
• Monomer-dimer model in two-dimensional rectangular lattices with fixed dimer density
• Packing dimers on $(2p+1)\times (2q+1)$ lattices
• The Pfaffian solution of a dimer-monomer problem: Single monomer on the boundary
• Logarithmic corrections in the free energy of monomer-dimer model on plane lattices with free boundaries
• Entropy of fully packed hard rigid rods on $d$-dimensional hyper-cubic lattices
• Exact solution of the $2d$ dimer model: Corner free energy, correlation functions and combinatorics
• Entropy of rigid k-mers on a square lattice
• Exact asymptotics of monomer-dimer model on rectangular semi-infinite lattices
• Power series expansions for the planar monomer-dimer problem