A plane partition is a two-dimensional array of integers n_(i, j) that are nonincreasing both from left to right and top to bottom and that add up to a given number n. In other words, n_(i, j)>=n_(i, j + 1) n_(i, j)>=n_(i + 1, j) and n = sum_(i, j) n_(i, j). Implicit in this definition is the requirement that the array be flush on top and to the left and contain no holes.
We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.