Math 2.0

Combinatorics Definition

Integer partition

Definition

Let nn be a natural number. A partition of nn is a finite multiset of positive integers whose sum is nn. Its elements are the parts of the partition.

Equivalently, a partition of nn is a finite sequence λ1≥λ2≥⋯≥λk\lambda_1 \ge \lambda_2 \ge \dots \ge \lambda_k of positive integers with λ1+⋯+λk=n\lambda_1 + \dots + \lambda_k = n.

Remarks

The order of the parts does not matter. A sum in which the order matters is a composition. The 55 partitions of 44 are 44, 3+13 + 1, 2+22 + 2, 2+1+12 + 1 + 1 and 1+1+1+11 + 1 + 1 + 1. The number 00 has exactly one partition, the empty partition. The number of partitions of nn is the partition function p(n)p(n), and a Young diagram draws a partition.

Where this leads

5 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Integer_partition, lead section
About this page
Tag0404R9P9J3
URIm2://0404R9P9J3
Kinddefinition
WritingW1 stated
MSC05A17
DefinesInteger partition

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by