Four symmetry classes of plane partitions under one roof (Q1924228)

The paper yields a unified approach to the enumeration of plain plane partitions, cyclically symmetric plane partitions, transpose-complement plane partitions, and the intersection of the last two types, based on Kasteleyn's permanent-determinant method. The main result of the paper is the following theorem: A Kasteleyn-flat, weighted adjacency matrix for the graph \(Z(a,b,c)\), whose matchings are bijective with plane partitions in an \(a\times b\times c\) box, arises as \(\alpha(X)|_{-1}\) in a representation \(\alpha\) of \(\text{sl}(2,C)\) which is a tensor product of three irreducible representations, with a basis formed from weight bases of irreducible representations. Consequently, \((\text{det }\alpha(X)|_{-1})/m\) is the number of such plane partitions, where \(m\) is the value of any term in the determinant.