A symmetrical plane partition correspondence (Q5966234)

By a direct, bijective argument the author proves that the number of partitions of n into at most m parts, each bounded by m equals the number of symmetrical plane partitions of 2n in an \(m\times m\times 2\) box. This is a special case of a more general result on the generating function for symmetrical plane partitions conjectured by \textit{P. A. MacMahon} [Combinatory analysis, vol. 2 (1960)] and proved by \textit{G. E. Andrews} [Proc. Natl. Acad. Sci. USA 74, 426-429 (1977; Zbl 0353.05006)] and \textit{I. G. Macdonald} [Symmetric functions and Hall polynomials (1979; Zbl 0487.20007)].