paper

Dimers and Dominoes

arXiv:1405.2615

Abstract

Using Kasteleyn's determinant method, we count perfect matchings of rectangular subgraphs of the square grid.

Unpublished report, written in 1992, revised in 1997