Partition (number theory)

Young diagrams associated to the partitions of the positive integers 1 through 8. They are arranged so that images under the reflection about the main diagonal of the square are conjugate partitions.

Partitions of n with biggest addend k

In number theory and combinatorics, a partition of a positive integer n, also called an integer partition, is a way of writing n as a sum of positive integers. Two sums that differ only in the order of their summands are considered the same partition. (If order matters, the sum becomes a composition.) For example, 4 can be partitioned in five distinct ways:

4

3 + 1

2 + 2

2 + 1 + 1

1 + 1 + 1 + 1

The order-dependent composition 1 + 3 is the same partition as 3 + 1, while the two distinct compositions 1 + 2 + 1 and 1 + 1 + 2 represent the same partition 2 + 1 + 1.

A summand in a partition is also called a part. The number of partitions of n is given by the partition function p(n). So p(4) = 5. The notation λ ⊢ n means that λ is a partition of n.

Partitions can be graphically visualized with Young diagrams or Ferrers diagrams. They occur in a number of branches of mathematics and physics, including the study of symmetric polynomials and of the symmetric group and in group representation theory in general.

Examples

The seven partitions of 5 are:

• 5
• 4 + 1
• 3 + 2
• 3 + 1 + 1
• 2 + 2 + 1
• 2 + 1 + 1 + 1
• 1 + 1 + 1 + 1 + 1

In some sources partitions are treated as the sequence of summands, rather than as an expression with plus signs. For example, the partition 2 + 2 + 1 might instead be written as the tuple (2, 2, 1) or in the even more compact form (2², 1) where the superscript indicates the number of repetitions of a term.

Representations of partitions

There are two common diagrammatic methods to represent partitions: as Ferrers diagrams, named after Norman Macleod Ferrers, and as Young diagrams, named after the British mathematician Alfred Young. Both have several possible conventions; here, we use English notation, with diagrams aligned in the upper-left corner.

Ferrers diagram

The partition 6 + 4 + 3 + 1 of the positive number 14 can be represented by the following diagram:

16px|*16px|*16px|*16px|*16px|*16px|*
16px|*16px|*16px|*16px|*
16px|*16px|*16px|*
16px|*

The 14 circles are lined up in 4 rows, each having the size of a part of the partition. The diagrams for the 5 partitions of the number 4 are listed below:

Young diagram

An alternative visual representation of an integer partition is its Young diagram (often also called a Ferrers diagram). Rather than representing a partition with dots, as in the Ferrers diagram, the Young diagram uses boxes or squares. Thus, the Young diagram for the partition 5 + 4 + 1 is

while the Ferrers diagram for the same partition is

*16px|*16px|*16px|*16px|* 16px|*16px|*16px|*16px|* 16px|*

While this seemingly trivial variation does not appear worthy of separate mention, Young diagrams turn out to be extremely useful in the study of symmetric functions and group representation theory: filling the boxes of Young diagrams with numbers (or sometimes more complicated objects) obeying various rules leads to a family of objects called Young tableaux, and these tableaux have combinatorial and representation-theoretic significance.^[1] As a type of shape made by adjacent squares joined together, Young diagrams are a special kind of polyomino.^[2]

Partition function

Using Euler's method to find p(40): A ruler with plus and minus signs (grey box) is slid downwards, the relevant terms added or subtracted. The positions of the signs are given by differences of alternating natural (blue) and odd (orange) numbers. In the SVG file, hover over the image to move the ruler.

Main page: Partition function (number theory)

The partition function [math]\displaystyle{ p(n) }[/math] equals the number of possible partitions of a non-negative integer [math]\displaystyle{ n }[/math]. For instance, [math]\displaystyle{ p(4)=5 }[/math] because the integer [math]\displaystyle{ 4 }[/math] has the five partitions [math]\displaystyle{ 1+1+1+1 }[/math], [math]\displaystyle{ 1+1+2 }[/math], [math]\displaystyle{ 1+3 }[/math], [math]\displaystyle{ 2+2 }[/math], and [math]\displaystyle{ 4 }[/math]. The values of this function for [math]\displaystyle{ n=0,1,2,\dots }[/math] are:

1, 1, 2, 3, 5, 7, 11, 15, 22, 30, 42, 56, 77, 101, 135, 176, 231, 297, 385, 490, 627, 792, 1002, 1255, 1575, 1958, 2436, 3010, 3718, 4565, 5604, ... (sequence A000041 in the OEIS).

The generating function of [math]\displaystyle{ p }[/math] is

[math]\displaystyle{ \sum_{n=0}^{\infty}p(n)q^n=\prod_{j=1}^{\infty}\sum_{i=0}^{\infty}q^{ji}=\prod_{j=1}^{\infty}(1-q^j)^{-1}. }[/math]

No closed-form expression for the partition function is known, but it has both asymptotic expansions that accurately approximate it and recurrence relations by which it can be calculated exactly. It grows as an exponential function of the square root of its argument.^[3] The multiplicative inverse of its generating function is the Euler function; by Euler's pentagonal number theorem this function is an alternating sum of pentagonal number powers of its argument.

[math]\displaystyle{ p(n)=p(n-1)+p(n-2)-p(n-5)-p(n-7)+\cdots }[/math]

Srinivasa Ramanujan discovered that the partition function has nontrivial patterns in modular arithmetic, now known as Ramanujan's congruences. For instance, whenever the decimal representation of [math]\displaystyle{ n }[/math] ends in the digit 4 or 9, the number of partitions of [math]\displaystyle{ n }[/math] will be divisible by 5.^[4]

Restricted partitions

In both combinatorics and number theory, families of partitions subject to various restrictions are often studied.^[5] This section surveys a few such restrictions.

Conjugate and self-conjugate partitions

If we flip the diagram of the partition 6 + 4 + 3 + 1 along its main diagonal, we obtain another partition of 14:

By turning the rows into columns, we obtain the partition 4 + 3 + 3 + 2 + 1 + 1 of the number 14. Such partitions are said to be conjugate of one another.^[6] In the case of the number 4, partitions 4 and 1 + 1 + 1 + 1 are conjugate pairs, and partitions 3 + 1 and 2 + 1 + 1 are conjugate of each other. Of particular interest is the partition 2 + 2, which has itself as conjugate. Such a partition is said to be self-conjugate.^[7]

Claim: The number of self-conjugate partitions is the same as the number of partitions with distinct odd parts.

Proof (outline): The crucial observation is that every odd part can be "folded" in the middle to form a self-conjugate diagram:

16px|*16px|*16px|*16px|*16px|*

↔

16px|*16px|* 16px|* 16px|*

One can then obtain a bijection between the set of partitions with distinct odd parts and the set of self-conjugate partitions, as illustrated by the following example:

Odd parts and distinct parts

Among the 22 partitions of the number 8, there are 6 that contain only odd parts:

• 7 + 1
• 5 + 3
• 5 + 1 + 1 + 1
• 3 + 3 + 1 + 1
• 3 + 1 + 1 + 1 + 1 + 1
• 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1

Alternatively, we could count partitions in which no number occurs more than once. Such a partition is called a partition with distinct parts. If we count the partitions of 8 with distinct parts, we also obtain 6:

• 8
• 7 + 1
• 6 + 2
• 5 + 3
• 5 + 2 + 1
• 4 + 3 + 1

This is a general property. For each positive number, the number of partitions with odd parts equals the number of partitions with distinct parts, denoted by q(n).^[8][9] This result was proved by Leonhard Euler in 1748^[10] and later was generalized as Glaisher's theorem.

For every type of restricted partition there is a corresponding function for the number of partitions satisfying the given restriction. An important example is q(n). The first few values of q(n) are (starting with q(0)=1):

1, 1, 1, 2, 2, 3, 4, 5, 6, 8, 10, ... (sequence A000009 in the OEIS).

The generating function for q(n) (partitions into distinct parts) is given by^[11]

[math]\displaystyle{ \sum_{n=0}^\infty q(n)x^n = \prod_{k=1}^\infty (1+x^k) = \prod_{k=1}^\infty \frac {1}{1-x^{2k-1}} . }[/math]

The pentagonal number theorem gives a recurrence for q:^[12]

q(k) = a_k + q(k − 1) + q(k − 2) − q(k − 5) − q(k − 7) + q(k − 12) + q(k − 15) − q(k − 22) − ...

where a_k is (−1)^m if k = 3m² − m for some integer m and is 0 otherwise.

Restricted part size or number of parts

By taking conjugates, the number p_k(n) of partitions of n into exactly k parts is equal to the number of partitions of n in which the largest part has size k. The function p_k(n) satisfies the recurrence

p_k(n) = p_k(n − k) + p_k−1(n − 1)

with initial values p₀(0) = 1 and p_k(n) = 0 if n ≤ 0 or k ≤ 0 and n and k are not both zero.^[13]

One recovers the function p(n) by

[math]\displaystyle{ p(n) = \sum_{k = 0}^n p_k(n). }[/math]

One possible generating function for such partitions, taking k fixed and n variable, is

[math]\displaystyle{ \sum_{n \geq 0} p_k(n) x^n = x^k \cdot \prod_{i = 1}^k \frac{1}{1 - x^i}. }[/math]

More generally, if T is a set of positive integers then the number of partitions of n, all of whose parts belong to T, has generating function

[math]\displaystyle{ \prod_{t \in T}(1-x^t)^{-1}. }[/math]

This can be used to solve change-making problems (where the set T specifies the available coins). As two particular cases, one has that the number of partitions of n in which all parts are 1 or 2 (or, equivalently, the number of partitions of n into 1 or 2 parts) is

[math]\displaystyle{ \left \lfloor \frac {n}{2}+1 \right \rfloor , }[/math]

and the number of partitions of n in which all parts are 1, 2 or 3 (or, equivalently, the number of partitions of n into at most three parts) is the nearest integer to (n + 3)² / 12.^[14]

Asymptotics

The asymptotic growth rate for p(n) is given by

[math]\displaystyle{ \log p(n) \sim C \sqrt n \text { as } n\rightarrow \infty }[/math]

where [math]\displaystyle{ C = \pi\sqrt\frac23. }[/math].^[15] The more precise asymptotic formula

[math]\displaystyle{ p(n) \sim \frac {1} {4n\sqrt3} \exp\left({\pi \sqrt {\frac{2n}{3}}}\right) }[/math] as [math]\displaystyle{ n\rightarrow \infty }[/math]

was first obtained by G. H. Hardy and Ramanujan in 1918 and independently by J. V. Uspensky in 1920. A complete asymptotic expansion was given in 1937 by Hans Rademacher.

If A is a set of natural numbers, we let p_A(n) denote the number of partitions of n into elements of A. If A possesses positive natural density α then

[math]\displaystyle{ \log p_A(n) \sim C \sqrt{\alpha n} }[/math]

and conversely if this asymptotic property holds for p_A(n) then A has natural density α.^[16] This result was stated, with a sketch of proof, by Erdős in 1942.^[17][18]

If A is a finite set, this analysis does not apply (the density of a finite set is zero). If A has k elements whose greatest common divisor is 1, then^[19]

[math]\displaystyle{ p_A(n) = \left(\prod_{a \in A} a^{-1}\right) \cdot \frac{n^{k-1}}{(k-1)!} + O(n^{k-2}) . }[/math]

Partitions in a rectangle and Gaussian binomial coefficients

Main page: Gaussian binomial coefficient

One may also simultaneously limit the number and size of the parts. Let p(N, M; n) denote the number of partitions of n with at most M parts, each of size at most N. Equivalently, these are the partitions whose Young diagram fits inside an M × N rectangle. There is a recurrence relation

[math]\displaystyle{ p(N,M;n) = p(N,M-1;n) + p(N-1,M;n-M) }[/math]

obtained by observing that [math]\displaystyle{ p(N,M;n) - p(N,M-1;n) }[/math] counts the partitions of n into exactly M parts of size at most N, and subtracting 1 from each part of such a partition yields a partition of n − M into at most M parts.^[20]

The Gaussian binomial coefficient is defined as:

[math]\displaystyle{ {k+\ell \choose \ell}_q = {k+\ell \choose k}_q = \frac{\prod^{k+\ell}_{j=1}(1-q^j)}{\prod^{k}_{j=1}(1-q^j)\prod^{\ell}_{j=1}(1-q^j)}. }[/math]

The Gaussian binomial coefficient is related to the generating function of p(N, M; n) by the equality

[math]\displaystyle{ \sum^{MN}_{n=0}p(N,M;n)q^n = {M+N \choose M}_q. }[/math]

Rank and Durfee square

Main page: Durfee square

The rank of a partition is the largest number k such that the partition contains at least k parts of size at least k. For example, the partition 4 + 3 + 3 + 2 + 1 + 1 has rank 3 because it contains 3 parts that are ≥ 3, but does not contain 4 parts that are ≥ 4. In the Ferrers diagram or Young diagram of a partition of rank r, the r × r square of entries in the upper-left is known as the Durfee square:

*16px|*16px|*16px|* 16px|*16px|*16px|* 16px|*16px|*16px|* 16px|*16px|* 16px|* 16px|*

The Durfee square has applications within combinatorics in the proofs of various partition identities.^[21] It also has some practical significance in the form of the h-index.

A different statistic is also sometimes called the rank of a partition (or Dyson rank), namely, the difference [math]\displaystyle{ \lambda_k - k }[/math] for a partition of k parts with largest part [math]\displaystyle{ \lambda_k }[/math]. This statistic (which is unrelated to the one described above) appears in the study of Ramanujan congruences.

Young's lattice

Main page: Young's lattice

There is a natural partial order on partitions given by inclusion of Young diagrams. This partially ordered set is known as Young's lattice. The lattice was originally defined in the context of representation theory, where it is used to describe the irreducible representations of symmetric groups S_n for all n, together with their branching properties, in characteristic zero. It also has received significant study for its purely combinatorial properties; notably, it is the motivating example of a differential poset.

See also

• Rank of a partition, a different notion of rank
• Crank of a partition
• Dominance order
• Factorization
• Integer factorization
• Partition of a set
• Stars and bars (combinatorics)
• Plane partition
• Polite number, defined by partitions into consecutive integers
• Multiplicative partition
• Twelvefold way
• Ewens's sampling formula
• Faà di Bruno's formula
• Multipartition
• Newton's identities
• Smallest-parts function
• A Goldbach partition is the partition of an even number into primes (see Goldbach's conjecture)
• Kostant's partition function

Notes

References

• Abramowitz, Milton; Stegun, Irene (1964). Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. United States Department of Commerce, National Bureau of Standards. ISBN 0-486-61272-4. 
• Andrews, George E. (1976). The Theory of Partitions. Cambridge University Press. ISBN 0-521-63766-X. 
• Andrews, George E.; Eriksson, Kimmo (2004). Integer Partitions. Cambridge University Press. ISBN 0-521-60090-1. 
• Apostol, Tom M. (1990). Modular functions and Dirichlet series in number theory. Graduate Texts in Mathematics. 41 (2nd ed.). New York etc.: Springer-Verlag. ISBN 0-387-97127-0. https://archive.org/details/modularfunctions0000apos.  (See chapter 5 for a modern pedagogical intro to Rademacher's formula).
• Bóna, Miklós (2002). A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory. World Scientific Publishing. ISBN 981-02-4900-4.  (an elementary introduction to the topic of integer partitions, including a discussion of Ferrers graphs)
• Hardy, G. H.; Wright, E. M. (2008) [1938]. An Introduction to the Theory of Numbers. Revised by D. R. Heath-Brown and J. H. Silverman. Foreword by Andrew Wiles. (6th ed.). Oxford: Oxford University Press. ISBN 978-0-19-921986-5. 
• Lehmer, D. H. (1939). "On the remainder and convergence of the series for the partition function". Trans. Amer. Math. Soc. 46: 362–373. doi:10.1090/S0002-9947-1939-0000410-9.  Provides the main formula (no derivatives), remainder, and older form for A_k(n).)
• Gupta, Hansraj; Gwyther, C.E.; Miller, J.C.P. (1962). Royal Society of Math. Tables. Volume 4, Tables of partitions.  (Has text, nearly complete bibliography, but they (and Abramowitz) missed the Selberg formula for A_k(n), which is in Whiteman.)
• Macdonald, Ian G. (1979). Symmetric functions and Hall polynomials. Oxford Mathematical Monographs. Oxford University Press. ISBN 0-19-853530-9.  (See section I.1)
• Nathanson, M.B. (2000). Elementary Methods in Number Theory. Graduate Texts in Mathematics. 195. Springer-Verlag. ISBN 0-387-98912-9. 
• Rademacher, Hans (1974). Collected Papers of Hans Rademacher. v II. MIT Press. pp. 100–07, 108–22, 460–75. 
• Sautoy, Marcus Du. (2003). The Music of the Primes. New York: Perennial-HarperCollins. https://archive.org/details/musicofprimessea00dusa. 
• Stanley, Richard P. (1999). Enumerative Combinatorics. Volumes 1 and 2. Cambridge University Press. ISBN 0-521-56069-1. http://www-math.mit.edu/~rstan/ec/. 
• Whiteman, A. L. (1956). "A sum connected with the series for the partition function". Pacific Journal of Mathematics 6 (1): 159–176. doi:10.2140/pjm.1956.6.159. http://projecteuclid.org/Dienst/UI/1.0/Summarize/euclid.pjm/1103044252.  (Provides the Selberg formula. The older form is the finite Fourier expansion of Selberg.)

External links

• Hazewinkel, Michiel, ed. (2001), "Partition", Encyclopedia of Mathematics, Springer Science+Business Media B.V. / Kluwer Academic Publishers, ISBN 978-1-55608-010-4, https://www.encyclopediaofmath.org/index.php?title=p/p071740 
• Partition and composition calculator
• Weisstein, Eric W.. "Partition". http://mathworld.wolfram.com/Partition.html. 
• Wilf, Herbert S. Lectures on Integer Partitions, http://www.math.upenn.edu/%7Ewilf/PIMS/PIMSLectures.pdf, retrieved 2021-02-28 
• Counting with partitions with reference tables to the On-Line Encyclopedia of Integer Sequences
• Integer partitions entry in the FindStat database
• Integer::Partition Perl module from CPAN
• Fast Algorithms For Generating Integer Partitions
• Generating All Partitions: A Comparison Of Two Encodings
• Grime, James (April 28, 2016). "Partitions - Numberphile" (video). Brady Haran. https://www.youtube.com/watch?v=NjCIq58rZ8I. 

0.00 (0 votes)