In mathematics and especially in combinatorics, a plane partition is a two-dimensional array of nonnegative integers π i , j {\displaystyle \pi _{i,j}} (with positive integer indices i and j) that is nonincreasing in both indices. This means that π i , j ≥ π i , j + 1 {\displaystyle \pi _{i,j}\geq \pi _{i,j+1}} and π i , j ≥ π i + 1 , j {\displaystyle \pi _{i,j}\geq \pi _{i+1,j}} for all i and j.
In mathematics and especially in combinatorics, a plane partition is a two-dimensional array of nonnegative integers π i , j {\displaystyle \pi _{i,j}} (with positive integer indices i and j) that is nonincreasing in both indices. This means that π i , j ≥ π i , j + 1 {\displaystyle \pi _{i,j}\geq \pi _{i,j+1}} and π i , j ≥ π i + 1 , j {\displaystyle \pi _{i,j}\geq \pi _{i+1,j}} for all i and j.
Source: Wikipedia "Plane partition" · CC BY-SA 4.0
Share this article: X · Bluesky