Combinatorics of the Dimer Model on a Strip
| dc.creator | Orlando, D. | |
| dc.creator | Reffert, S. | |
| dc.date | 2007-09-11 | |
| dc.date.accessioned | 2026-07-07T08:28:43Z | |
| dc.date.available | 2026-07-07T08:28:43Z | |
| dc.description | In this note, we give a closed formula for the partition function of the dimer model living on a (2 x n) strip of squares or hexagons on the torus for arbitrary even n. The result is derived in two ways, by using a Potts model like description for the dimers, and via a recursion relation that was obtained from a map to a 1D monomer-dimer system. The problem of finding the number of perfect matchings can also be translated to the problem of finding a minmal feedback arc set on the dual graph. | |
| dc.description | 19 pages, 12 figures | |
| dc.identifier | https://arxiv.org/abs/0709.1546 | |
| dc.identifier | http://arxiv.org/abs/0709.1546 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/137718 | |
| dc.subject | Combinatorics | |
| dc.subject | Statistical Mechanics | |
| dc.subject | High Energy Physics - Theory | |
| dc.title | Combinatorics of the Dimer Model on a Strip | |
| dc.type | text |