Plane partition
Summary
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
Further reading
- Wikipedia, page 2933308, revision 1352601219, Plane partition. adopted
About this page
| Tag | PK5WXS96K7 |
|---|---|
| URI | m2://PK5WXS96K7 |
| Aliases | macmahon-function, planar-partition, planar-partitions |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.