Combinatorics Permutations, partitions, words Concept
Integer partition
Summary
An integer partition is a way to write a natural number as a sum of positive integers, without regard to order. Partitions are central objects of combinatorics, number theory and the representation theory of symmetric groups. The node integer partition gives the precise definition.
Where this leads
17 pages build on this one.
- Robinson–Schensted correspondence
- Young tableau
- Twelvefold way
- Hypergeometric function of a matrix argument
- Representation theory of the symmetric group
- Robinson–Schensted–Knuth correspondence
- Specht module
- Schur polynomial
- Young's lattice
- Macdonald polynomial
- Jack function
- Rogers–Ramanujan identities
- Symmetric function
- Pentagonal number theorem
- Littlewood–Richardson rule
- Euler's pentagonal number theorem
- Hook length formula
Further reading
- Web https://en.wikipedia.org/wiki/Integer_partition, lead section
About this page
| Tag | 0JV30XN73Z |
|---|---|
| URI | m2://0JV30XN73Z |
| Kind | concept |
| Writing | W1 stated |
| MSC | 05A17 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- 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
Definitions
Used by
- Robinson–Schensted correspondence
- Young tableau
- Twelvefold way
- Hypergeometric function of a matrix argument
- Representation theory of the symmetric group
- Specht module
- Schur polynomial
- Young's lattice
- Macdonald polynomial
- Jack function
- Rogers–Ramanujan identities
- Symmetric function
- Pentagonal number theorem
- Littlewood–Richardson rule
- Euler's pentagonal number theorem
- Hook length formula