Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Plane_partition> ?p ?o. }
Showing items 1 to 18 of
18
with 100 items per page.
- Plane_partition abstract "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, 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 the point (i,j) in the plane, giving a three-dimensional solid like the one shown at right.The sum of a plane partition isand PL(n) denotes the number of plane partitions with sum n.For example, there are six plane partitions with sum 3:so PL(3) = 6. (Here the plane partitions are drawn using matrix indexing for the coordinates and the entries equal to 0 are suppressed for readability.)".
- Plane_partition thumbnail Partition3D.svg?width=300.
- Plane_partition wikiPageExternalLink 26.12.
- Plane_partition wikiPageExternalLink text-idx?c=umhistmath;idno=ABU9009.
- Plane_partition wikiPageID "2933308".
- Plane_partition wikiPageRevisionID "587161200".
- Plane_partition hasPhotoCollection Plane_partition.
- Plane_partition title "Plane partition".
- Plane_partition urlname "PlanePartition".
- Plane_partition subject Category:Enumerative_combinatorics.
- Plane_partition comment "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, that is, that satisfies for all i and j,and for which only finitely many of the ni,j are nonzero.".
- Plane_partition label "Plane partition".
- Plane_partition sameAs m.08dl1l.
- Plane_partition sameAs Q7201015.
- Plane_partition sameAs Q7201015.
- Plane_partition wasDerivedFrom Plane_partition?oldid=587161200.
- Plane_partition depiction Partition3D.svg.
- Plane_partition isPrimaryTopicOf Plane_partition.
