The partition function is defined as follows.
Note that it is also the generating function for matchings, or the matching polynomial.
The aim is at finding methods to compute Z(l) at a given point.
| Given a graph
G a monomer-dimer configuration is a covering of non overlapping
monomers (single nodes) and dimers (pairs of adjacent nodes). Essentially
it is matching. Let a k-matching be a matching with k matched arcs
and let mk be the number
of k-matchings. The partition function is defined as follows. Note that it is also the generating function for matchings, or the matching polynomial. The aim is at finding methods to compute Z(l) at a given point. |
|
