An exploration of the permanent-determinant method

50Citations
Citations of this article
26Readers
Mendeley users who have this article in their library.

Abstract

The permanent-determinant method and its generalization, the Hafnian-Pfaffian 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: 1. If a bipartite graph on the sphere with 4n vertices is invariant under the antipodal map, the number of matchings is the square of the number of matchings of the quotient graph. 2. The number of matchings of the edge graph of a graph with vertices of degree at most 3 is a power of 2. 3. The three Carlitz matrices whose determinants count a x b x c plane partitions all have the same cokernel. 4. Two symmetry classes of plane partitions can be enumerated with almost no calculation.

Cite

CITATION STYLE

APA

Kuperberg, G. (1998). An exploration of the permanent-determinant method. Electronic Journal of Combinatorics, 5(1). https://doi.org/10.37236/1384

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free