An Exploration of the Permanent-Determinant Method

The permanent-determinant method and its generalization, the HafnianPfaffian method, are methods to enumerate perfect matchings of plane graphs that were discovered by P. W. Kasteleyn. We present several new techniques and arguments related to the permanent-determinant with consequences in enumerative combinatorics. Here are some of the results that follow from these techniques:

• Type: Journal
• Year: 1998
• Where: COMBINATORICS
• Authors: Greg Kuperberg
• Keywords: COMBINATORICS 1998, HafnianPfaffian Method, Perfect Matchings, Permanent-determinant Method