Plane partition
From Wikipedia, the free encyclopedia
In mathematics, a plane partition (also solid partition) is a two-dimensional array of nonnegative integers ni,j which are nonincreasing from left to right and top to bottom:
Thinking of the stack of ni,j unit cubes placed on (i,j)-square, we obtain a solid (or 3-dimensional) partition.
Define the sum of the plane partition by
and let PL(n) denote the number of plane partitions with sum n.
For example, there are six plane partitions with sum 3:
so PL(3) = 6.
Contents |
[edit] Generating function
By a result of Percy MacMahon the generating function for PL(n), the number of plane partitions of n, can be calculated by
This results is 2-dimensional analogue of Euler's product formula for the number of integer partitions of n. There is no analogous formula for partitions in higher dimensions.
[edit] MacMahon formula
Denote by M(a,b,c) the number of solid partitions which fit into box. In the planar case, we obtain the binomial coefficients:
MacMahon formula is the multiplicative formula for general values of M(a,b,c):
This formula was obtained by Percy MacMahon and was later rewritten in this form by Ian Macdonald.
[edit] References
- P.A. MacMahon, Combinatory analysis, 2 vols, Cambridge University Press, 1915-16.
- G. Andrews, The Theory of Partitions, Cambridge University Press, Cambridge, 1998, ISBN 052163766X
- I.G. Macdonald, Symmetric Functions and Hall Polynomials, Oxford University Press, Oxford, 1999, ISBN 0198504500
[edit] External links
- Eric W. Weisstein, Plane partition at MathWorld.
- (sequence A000219 in OEIS).