Abstract
We present new, simple proofs for the enumeration of five of the ten symmetry classes of plane partitions contained in a given box. Four of them are derived from a simple determinant evaluation, using combinatorial arguments. The previous proofs of these four cases were quite complicated. For one more symmetry class we give an elementary proof in the case when two of the sides of the box are equal. Our results include simple evaluations of the determinants $\det\big(\delta_{ij}+\binom{x+i+j}{i}\big)_{0\le i,\, j\le n-1}$ and $\det\big(\binom{x+i+j}{2j-i}\big)_{0\le i,\,j \le n-1}$, notorious in plane partition enumeration, whose previous evaluations were quite intricate.
Information
Digital Object Identifier: 10.2969/aspm/02810081