Integer partitions | Enumerative combinatorics
Plane partition
In mathematics and especially in combinatorics, a plane partition is a two-dimensional array of nonnegative integers (with positive integer indices i and j) that is nonincreasing in both indices. This means that and for all i and j. Moreover, only finitely many of the may be nonzero. Plane partitions are a generalization of partitions of an integer. A plane partition may be represented visually by the placement of a stack of unit cubes above the point (i, j) in the plane, giving a three-dimensional solid as shown in the picture. The image has matrix form Plane partitions are also often described by the positions of the unit cubes. From this point of view, a plane partition can be defined as a finite subset of positive integer lattice points (i, j, k) in , such that if (r, s, t) lies in and if satisfies , , and , then (i, j, k) also lies in . The sum of a plane partition is The sum describes the number of cubes of which the plane partition consists. Much interest in plane partitions concerns the enumeration of plane partitions in various classes. The number of plane partitions with sum n is denoted by PL(n). For example, there are six plane partitions with sum 3 so PL(3) = 6. Plane partitions may be classified by how symmetric they are. Many symmetric classes of plane partitions are enumerated by simple product formulas. (Wikipedia).
