Plane partition

In mathematics and especially in combinatorics, a plane partition is a two-dimensional array of nonnegative integers $$ n_{i,j}} n_ $$ (with positive integer indices i and j) that is nonincreasing in both indices, that is, that satisfies for all i and j, and for which only finitely many of the ni,j are nonzero. A plane partitions may be represented visually by the placement of a stack of unit cubes above each other giving a three-dimensional solid like the one shown at right.

Source: Wikipedia

Date

February 28, 2024

Five interlaced pentagons An ornamental design of five alternately interlaced pentagons (a kind of five-fold counterpart to the three-fold Valknut). No two pentagons are

Previously

Parametric polymorphism The idea of code reuse arises from the necessity for constructing large software systems combining well-established building blocks. The reusability

Plane partition

Date

Next

Previously