Partition (number theory)

In number theory, a partition of a positive integer n is a way of writing n as a sum of positive integers. Two sums which only differ in the order of their summands are considered to be the same partition; if order matters then the sum becomes a composition. A summand in a partition is also called a part. The number of partitions of n is given by the partition function p(n).

Examples

The partitions of 4 are listed below:

1. 4
2. 3 + 1
3. 2 + 2
4. 2 + 1 + 1
5. 1 + 1 + 1 + 1

The partitions of 8 are listed below:

1. 8
2. 7 + 1
3. 6 + 2
4. 6 + 1 + 1
5. 5 + 3
6. 5 + 2 + 1
7. 5 + 1 + 1 + 1
8. 4 + 4
9. 4 + 3 + 1
10. 4 + 2 + 2
11. 4 + 2 + 1 + 1
12. 4 + 1 + 1 + 1 + 1
13. 3 + 3 + 2
14. 3 + 3 + 1 + 1
15. 3 + 2 + 2 + 1
16. 3 + 2 + 1 + 1 + 1
17. 3 + 1 + 1 + 1 + 1 + 1
18. 2 + 2 + 2 + 2
19. 2 + 2 + 2 + 1 + 1
20. 2 + 2 + 1 + 1 + 1 + 1
21. 2 + 1 + 1 + 1 + 1 + 1 + 1
22. 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1

Partition function

In number theory, the partition function p(n) represents the number of possible partitions of a natural number n, which is to say the number of distinct (and order independent) ways of representing n as a sum of natural numbers. For example, 4 can be partitioned in 5 distinct ways:

4,     3 + 1,     2 + 2,     2 + 1 + 1,     1 + 1 + 1 + 1.

So p(4) = 5. By convention p(0) = 1, p(n) = 0 for n negative. Partitions can be graphically visualized with Young diagrams. They occur in a number of branches of mathematics and physics, including the study of symmetric polynomials, the symmetric group and in group representation theory in general.

Intermediate function

One way of getting a handle on the partition function involves an intermediate function p(k, n) which represents the number of partitions of n using only natural numbers at least as large as k. For any given value of k, partitions counted by p(k, n) fit into exactly one of the following categories:

1. smallest addend is k
2. smallest addend is strictly greater than k

The number of partitions meeting the first condition is p(k, n − k). To see this, imagine a list of all the partitions of the number n − k into numbers of size at least k, then imagine appending "+ k" to each partition in the list. Now what is it a list of?

The number of partitions meeting the second condition is p(k + 1, n) since a partition into parts of at least k which contains no parts of exactly k must have all parts at least k + 1.

Since the two conditions are mutually exclusive, the number of partitions meeting either condition is p(k + 1, n) + p(k, n − k). The base cases of this recursively defined function are as follows:

• p(k, n) = 0 if k > n

• p(k, n) = 1 if k = n

This function tends to exhibit deceptive behavior.

p(1, 4) = 5

p(2, 8) = 7

p(3, 12) = 9

p(4, 16) = 11

p(5, 20) = 13

p(6, 24) = 16

Our original function p(n) is just p(1, n).

The values of this function:

		k
		1	2	3	4	5	6	7	8	9	10
n	1	1
	2	2	1
	3	3	1	1
	4	5	2	1	1
	5	7	2	2	1	1
	6	11	4	2	1	1	1
	7	15	4	2	1	1	1	1
	8	22	7	3	2	1	1	1	1
	9	30	8	4	2	1	1	1	1	1
	10	42	12	5	3	2	1	1	1	1	1

Generating function

A generating function for p(n) is given by the reciprocal of Euler's function:

Failed to parse (Missing texvc executable; please see math/README to configure.): \sum_{n=0}^\infty p(n)x^n = \prod_{k=1}^\infty \left(\frac {1}{1-x^k} \right).

Expanding each term on the right-hand side as a geometric series, we can rewrite it as

(1 + x + x² + x³ + ...)(1 + x² + x⁴ + x⁶ + ...)(1 + x³ + x⁶ + x⁹ + ...) ...

The xⁿ term in this product counts the number of ways to write

n = a₁ + 2a₂ + 3a₃ + ... = (1 + 1 + ... + 1) + (2 + 2 + ... + 2) + (3 + 3 + ... + 3) + ...,

where each number i appears a_i times. This is precisely the definition of a partition of n, so our product is the desired generating function. More generally, the generating function for the partitions of n into numbers from a set A can be found by taking only those terms in the product where k is an element of A. This result is due to Euler.

The formulation of Euler's generating function is a special case of a q-Pochhammer symbol and is similar to the product formulation of many modular forms, and specifically the Dedekind eta function. It can also be used in conjunction with the pentagonal number theorem to derive a recurrence for the partition function stating that:

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

where the sum is taken over all generalized pentagonal numbers of the form ½n(3n − 1). The signs in the summation continue to alternate +, +, −, −, +, +, ... Note that generalized pentagonal numbers include those where n < 0 in the pentagonal number formula, and can be generated by successively applying the values 1, -1, 2, -2, 3, -3, 4, -4 ...for the value of n in the pentagonal number formula, generating the values 1, 2, 5, 7, 12, 15, 22, 26, 35, 40, 51...

Table of values

Some values of the partition function are as follows (sequence A000041 in OEIS):

• p(1) = 1
• p(2) = 2
• p(3) = 3
• p(4) = 5
• p(5) = 7
• p(6) = 11
• p(7) = 15
• p(8) = 22
• p(9) = 30
• p(10) = 42
• p(100) = 190,569,292
• p(1000) = 24,061,467,864,032,622,473,692,149,727,991 ≈ 2.4 × 10³¹

Rademacher's series

An asymptotic expression for p(n) is given by

Failed to parse (Missing texvc executable; please see math/README to configure.): p(n) \sim \frac {\exp \left( \pi \sqrt {2n/3}\right) } {4n\sqrt{3}} \mbox { as } n\rightarrow \infty.

This expression was first obtained by G. H. Hardy and Ramanujan in 1918 and independently by J. V. Uspensky in 1920. Considering Failed to parse (Missing texvc executable; please see math/README to configure.): p(1000) , the asymptotic formula gives about Failed to parse (Missing texvc executable; please see math/README to configure.): 2.4402\times 10^{31} , reasonably close to the exact answer given above.

In 1937, Hans Rademacher was able to improve on Hardy and Ramanujan's results by providing a convergent series expression for p(n). It is

Failed to parse (Missing texvc executable; please see math/README to configure.): p(n)=\frac{1}{\pi \sqrt{2}} \sum_{k=1}^\infty A_k(n)\; \sqrt{k} \; \frac{d}{dn} \left( \frac {\sinh \left( \frac{\pi}{k} \sqrt{\frac{2}{3}\left(n-\frac{1}{24}\right)}\right) } {\sqrt{n-\frac{1}{24}}}\right)

where

Failed to parse (Missing texvc executable; please see math/README to configure.): A_k(n) = \sum_{0\le m < k \; ; \; (m,k)=1}\exp \left\{ \pi i \left[ s(m,k) - 2 nm/k \right] \right\}.

Here, the notation Failed to parse (Missing texvc executable; please see math/README to configure.): (m,n)=1

implies that the sum should occur only over the values of m that are relatively prime to n. The function Failed to parse (Missing texvc executable; please see math/README to configure.): s(m,k)
is a Dedekind sum.  The proof of Rademacher's formula is interesting in that it involves Ford circles, Farey sequences, modular symmetry and the Dedekind eta function in a central way.

Congruences

Mathematician Srinivasa Ramanujan is credited with discovering that "congruences" in the number of partitions exist for integers ending in 4 and 9.

Failed to parse (Missing texvc executable; please see math/README to configure.): p(5k+4)\equiv 0 \pmod 5

For instance, the number of partitions for the integer 4 is 5. For the integer 9, the number of partitions is 30; for 14 there are 135 partitions. He also discovered congruences related to 7 and 11:

Failed to parse (Missing texvc executable; please see math/README to configure.): p(7k+5)\equiv 0 \pmod 7

Failed to parse (Missing texvc executable; please see math/README to configure.): p(11k+6)\equiv 0 \pmod {11}

Since 5, 7, and 11 are consecutive primes, one might think that Failed to parse (Missing texvc executable; please see math/README to configure.): p(13k+7)\equiv 0 \pmod {13} . This is, however, false.

In the 1960s, A. O. L. Atkin of the University of Illinois at Chicago discovered additional congruences for small prime moduli. For example:

Failed to parse (Missing texvc executable; please see math/README to configure.): p(17303k+237)\equiv 0 \pmod {13}

In 2000, Ken Ono of the University of Wisconsin-Madison proved that there are such congruences for every prime modulus. A few years later Ono, together with Scott Ahlgren of the University of Illinois, proved that there are partition congruences modulo every integer coprime to 6.

Restricted partitions

Among the 22 partitions for the number 8, 6 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

If we count the partitions of 8 with distinct parts, we also obtain the number 6:

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

It is true for all positive numbers that the number of partitions with odd parts always equals the number of partitions with distinct parts. This result was proved by Leonard Euler in 1748.^[1]

Some similar results about restricted partitions can be obtained by the aid of a visual tool, a Ferrers graph (also called Ferrers diagram, since it is not a graph in the graph-theoretical sense, or sometimes Young diagram, alluding to the Young tableau).

Ferrers diagram

The partition 6 + 4 + 3 + 1 of the positive number 14 can be represented by the following diagram, which is named in honor of Norman Macleod Ferrers:

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

If we now flip the diagram of the partition 6 + 4 + 3 + 1 along the NW-SE axis, 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. 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.

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

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

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:

Similar techniques can be employed to establish, for example, the following equalities:

• The number of partitions of n into no more than k parts is the same as the number of partitions of n into parts no larger than k.
• The number of partitions of n into no more than k parts is the same as the number of partitions of n+k into exactly k parts.

See also

• Combinadic
• Ewens's sampling formula
• Faà di Bruno's formula
• Multiset
• Newton's identities
• Partition of a set
• Plane partition
• Multiplicative partition
• Egyptian fraction
• RMP 2/n table

References

• Tom M. Apostol, Modular functions and Dirichlet Series in Number Theory (1990), Springer-Verlag, New York. ISBN 0-387-97127-0 (See chapter 5 for a modern pedagogical intro to Rademacher's formula).

• D. H. Lehmer, On the remainder and convergence of the series for the partition function Trans. Amer. Math. Soc. 46(1939) pp 362-373. (Provides the main formula (no derivatives), remainder, and older form for A_k(n).)

• Gupta, Gwyther, Miller, Roy. Soc. Math. Tables, vol 4, Tables of partitions, (1962) (Has text, nearly complete bibliography, but they (and Abramowitz) missed the Selberg formula for A_k(n) which is in Whiteman.)

• Ken Ono, Distribution of the partition function modulo m

Annals of Mathematics 151 (2000) pp 293-307. (This paper proves congruences modulo every prime greater than 3)

• A. L. Whiteman, A sum connected with the series for the partition function, Pacific Journal of Math. 6:1 (1956) 159-176. (Provides the Selberg formula. The older form is the finite Fourier expansion of Selberg.)

• Hans Rademacher, Collected Papers of Hans Rademacher, (1974) MIT Press; v II, p 100-107, 108-122, 460-475.

An elementary introduction to the topic of integer partition, including a discussion of Ferrers graphs, can be found in the following reference:

Miklós Bóna, A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory, World Scientific Publishing, 2002. ISBN 981-02-4900-4.

Another highly accessible introduction is:

George Andrews and Kimmo Eriksson, Integer Partitions, Cambridge University Press, 2004. ISBN 0-521-60090-1.

• 'A Disappearing Number', devised piece by Complicite, mention Ramanujen's work on the Partition Function, 2007

External links

• Partition and composition calculator
• First 4096 values of the partition function
• An algorithm to compute the partition function
• Eric W. Weisstein, Partition at MathWorld.
• Eric W. Weisstein, Partition Function P at MathWorld.
• Pieces of Number from Science News Online
• Lectures on Integer Partitions by Herbert S. Wilf
• A000041: Number of partitions of n from The On-Line Encyclopedia of Integer Sequences
• Integer::Partition Perl module from CPANde:Partitionsfunktion

fr:Partage d'un entier it:Partizione di un intero he:פונקציית החלוקה (תורת המספרים) ja:整数分割 ru:Разбиение числа sv:Partitionsfunktionen