Partition function (number theory) explained

In number theory, the partition function represents the number of possible partitions of a non-negative integer . For instance, because the integer 4 has the five partitions,,,, and .

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. 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.

Srinivasa Ramanujan first discovered that the partition function has nontrivial patterns in modular arithmetic, now known as Ramanujan's congruences. For instance, whenever the decimal representation of ends in the digit 4 or 9, the number of partitions of will be divisible by 5.

Definition and examples

For a positive integer, is the number of distinct ways of representing as a sum of positive integers. For the purposes of this definition, the order of the terms in the sum is irrelevant: two sums with the same terms in a different order are not considered to be distinct.

By convention, as there is one way (the empty sum) of representing zero as a sum of positive integers. Furthermore when is negative.

The first few values of the partition function, starting with, are:

Some exact values of for larger values of include:

Generating function

See main article: Pentagonal number theorem. The generating function for p(n) is given byThe equality between the products on the first and second lines of this formulais obtained by expanding each factor

1 /( 1- x ^{k)} into the geometric series ( 1+ x ^{k+x} ^{2k} + x ^{3k} + … ). To see that the expanded product equals the sum on the first line,apply the distributive law to the product. This expands the product into a sum of monomials of the form x ^{a _{1}} x ^{2 a _{2}} x ^{3 a _{3}} … for some sequence of coefficientsa _{i} , only finitely many of which can be non-zero.The exponent of the term is $n\; =\; \backslash sum\; i\; a\_i$, and this sum can be interpreted as a representation of n as a partition into a _{i} copies of each number i . Therefore, the number of terms of the product that have exponent n is exactly p(n) , the same as the coefficient of x ^{n} in the sum on the left.Therefore, the sum equals the product.

The function that appears in the denominator in the third and fourth lines of the formula is the Euler function. The equality between the product on the first line and the formulas in the third and fourth lines is Euler's pentagonal number theorem.The exponents of

x in these lines are the pentagonal numbers P _{k} = k( 3 k -1 )/ 2 for k \in \{ 0 , 1 , -1 , 2 , -2 , ... \} (generalized somewhat from the usual pentagonal numbers, which come from the same formula for the positive values The pattern of positive and negative signs in the third line comes from the term ( -1 ) ^{k} in the fourth line: even choices of k produce positive terms, and odd choices produce negative terms.

More generally, the generating function for the partitions of

n into numbers selected from a set A of positive integers can be found by taking only those terms in the first product for which k\in A . This result is due to Leonhard 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.

Recurrence relations

The same sequence of pentagonal numbers appears in a recurrence relation for the partition function:As base cases,

p( 0 ) is taken to equal 1 , and p(k) is taken to be zero for negative k . Although the sum on the right side appears infinite, it has only finitely many nonzero terms,coming from the nonzero values of k in the range$$-\; \backslash frac\; \backslash leq\; k\; \backslash leq\; \backslash frac.$$The recurrence relation can also be written in the equivalent form$$p(n)\; =\; \backslash sum\_^\backslash infty\; (-1)^\; \backslash big(p(n-k(3k-1)/2)\; +\; p(n-k(3k+1)/2)\backslash big)\; .$$

Another recurrence relation for

p(n) can be given in terms of the sum of divisors function :$$p(n)\; =\; \backslash frac\; \backslash sum\_^\; \backslash sigma(n-k)\; p(k).$$If q(n) denotes the number of partitions of n with no repeated parts then it follows by splitting each partition into its even parts and odd parts, and dividing the even parts by two, that$$p(n)\; =\; \backslash sum\_^\; q(n-2k)\; p(k).$$

Congruences

See main article: Ramanujan's congruences. Srinivasa Ramanujan is credited with discovering that the partition function has nontrivial patterns in modular arithmetic.For instance the number of partitions is divisible by five whenever the decimal representation of

n ends in the digit 4 or 9, as expressed by the congruence$$p(5k+4)\; \backslash equiv\; 0\; \backslash 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. This congruence is implied by the more general identity$$\backslash sum\_^\backslash infty\; p(5k+4)x^k\; =\; 5~\; \backslash frac,$$also by Ramanujan, where the notation (x) _{infty} denotes the product defined by$$(x)\_\backslash infty\; =\; \backslash prod\_^\backslash infty\; (1-x^m).$$A short proof of this result can be obtained from the partition function generating function.

Ramanujan also discovered congruences modulo 7 and 11:The first one comes from Ramanujan's identity$$\backslash sum\_^\backslash infty\; p(7k+5)x^k\; =\; 7~\; \backslash frac\; +49x\; ~\; \backslash frac\; .$$

Since 5, 7, and 11 are consecutive primes, one might think that there would be an analogous congruence for the next prime 13,

p( 13 k + a) \equiv 0 \pmod{ 13 } for some . However, there is no congruence of the form p(bk + a) \equiv 0 \pmod{b} for any prime b other than 5, 7, or 11. Instead, to obtain a congruence, the argument of p should take the form cbk + a for some c> 1 . In the 1960s, A. O. L. Atkin of the University of Illinois at Chicago discovered additional congruences of this form for small prime moduli. For example:$$p(11^3\; \backslash cdot\; 13\; \backslash cdot\; k\; +\; 237)\backslash equiv\; 0\; \backslash pmod\; .$$

proved that there are such congruences for every prime modulus greater than 3. Later, showed there are partition congruences modulo every integer coprime to 6.

Approximation formulas

Approximation formulas exist that are faster to calculate than the exact formula given above.

An asymptotic expression for p(n) is given by

p(n) \sim (1)/(4 n\sqrt 3) \exp\left({\pi \sqrt { (2 n)/(3) }}\right) as n \to inf ty .This asymptotic formula was first obtained by G. H. Hardy and Ramanujan in 1918 and independently by J. V. Uspensky in 1920. Considering p( 1000 ) , the asymptotic formula gives about 2 . 4402 x 10 ^{31} , reasonably close to the exact answer given above (1.415% larger than the true value).

Hardy and Ramanujan obtained an asymptotic expansion with this approximation as the first term:$$p(n)\; \backslash sim\; \backslash frac\; \backslash sum\_^v\; A\_k(n)\backslash sqrt\; \backslash cdot\backslash frac\; \backslash left(\backslash right),$$where$$A\_k(n)\; =\; \backslash sum\_e^.$$Here, the notation

(m,k) =1 means that the sum is taken only over the values of m that are relatively prime to k . The function s(m,k) is a Dedekind sum.

The error after

v terms is of the order of the next term, and v may be taken to be of the order of \sqrt n . As an example, Hardy and Ramanujan showed that p( 200 ) is the nearest integer to the sum of the first v = 5 terms of the series.

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$$p(n)\; =\; \backslash frac\; \backslash sum\_^\backslash infty\; A\_k(n)\backslash sqrt\; \backslash cdot\backslash frac\; \backslash left(\backslash right)\; .$$

The proof of Rademacher's formula involves Ford circles, Farey sequences, modular symmetry and the Dedekind eta function.

It may be shown that the

k th term of Rademacher's series is of the order$$\backslash exp\backslash left(\backslash frac\; \backslash sqrt\backslash frac\; \backslash right),$$so that the first term gives the Hardy–Ramanujan asymptotic approximation. published an elementary proof of the asymptotic formula for p(n) .

Techniques for implementing the Hardy–Ramanujan–Rademacher formula efficiently on a computer are discussed by, who shows that

p(n) can be computed in time O(n ^{1/2+\varepsilon} ) for any \varepsilon> 0 . This is near-optimal in that it matches the number of digits of the result. The largest value of the partition function computed exactly is p( 10 ^{20} ) , which has slightly more than 11 billion digits.

Strict partition function

Definition and properties

A partition in which no part occurs more than once is called strict, or is said to be a partition into distinct parts. The function q(n) gives the number of these strict partitions of the given sum n. For example, q(3) = 2 because the partitions 3 and 1 + 2 are strict, while the third partition 1 + 1 + 1 of 3 has repeated parts. The number q(n) is also equal to the number of partitions of n in which only odd summands are permitted.^[1]

Example values of q(n) and associated partitions

n	q(n)	Strict partitions	Partitions with only odd parts
0	1	empty partition	empty partition
1	1	1	1
2	1	2	1+1
3	2	1+2, 3	1+1+1, 3
4	2	1+3, 4	1+1+1+1, 1+3
5	3	2+3, 1+4, 5	1+1+1+1+1, 1+1+3, 5
6	4	1+2+3, 2+4, 1+5, 6	1+1+1+1+1+1, 1+1+1+3, 3+3, 1+5
7	5	1+2+4, 3+4, 2+5, 1+6, 7	1+1+1+1+1+1+1, 1+1+1+1+3, 1+3+3, 1+1+5, 7
8	6	1+3+4, 1+2+5, 3+5, 2+6, 1+7, 8	1+1+1+1+1+1+1+1, 1+1+1+1+1+3, 1+1+3+3, 1+1+1+5, 3+5, 1+7
9	8	2+3+4, 1+3+5, 4+5, 1+2+6, 3+6, 2+7, 1+8, 9	1+1+1+1+1+1+1+1+1, 1+1+1+1+1+1+3, 1+1+1+3+3, 3+3+3, 1+1+1+1+5, 1+3+5, 1+1+7, 9

Generating function

The generating function for the numbers q(n) is given by a simple infinite product:^[2] $$\backslash sum\_^\; q(n)x^n\; =\; \backslash prod\_^\backslash infty\; (1\; +\; x^k)\; =\; (x;x^2)\_^,$$where the notation

(a;b) _{infty} represents the Pochhammer symbol (a;b) _{infty} = \prod ^{inf ty} _{k =0} ( 1 - ab ^{k} ). From this formula, one may easily obtain the first few terms :$$\backslash sum\_^\; q(n)x^n\; =\; 1+1x+1x^2+2x^3+2x^4+3x^5+4x^6+5x^7+6x^8+8x^9+10x^+\backslash ldots.$$This series may also be written in terms of theta functions as$$\backslash sum\_^\; q(n)x^n\; =\; \backslash vartheta\_(x)^\backslash vartheta\_(x)^\backslash biggl\backslash ^,$$where$$\backslash vartheta\_(x)\; =\; 1\; +\; 2\backslash sum\_^\; x^$$and$$\backslash vartheta\_(x)\; =\; 1\; +\; 2\backslash sum\_^\; (-1)^\; x^.$$In comparison, the generating function of the regular partition numbers p(n) has this identity with respect to the theta function:$$\backslash sum\_^\; p(n)x^n\; =\; (x;x)\_^\; =\; \backslash vartheta\_(x)^\backslash vartheta\_(x)^\backslash biggl\backslash ^.$$

Identities about strict partition numbers

Following identity is valid for the Pochhammer products:

(x;x) ^{-1} _{inf ty} = (x ^{2;x} ^{-1} ^{inf ty} (x;x ^{-1} _{inf ty}

From this identity follows that formula:

l [\sum ^{inf ty} _{n =0} p(n)x ^{nr]} = l [\sum ^{inf ty} _{n =0} p(n)x ^{2n} r ] l [\sum ^{inf ty} _{n =0} q(n)x ^{nr]}

Therefore those two formulas are valid for the synthesis of the number sequence p(n):

p( 2 n) = \sum ^{n} _{k =0} p(n - k)q( 2 k) p( 2 n +1 ) = \sum ^{n} _{k =0} p(n - k)q( 2 k + 1 )

In the following, two examples are accurately executed:

p( 8 ) = \sum ^{4} _{k =0} p( 4 - k)q( 2 k) = = p( 4 )q( 0 ) + p( 3 )q( 2 ) + p( 2 )q( 4 ) + p( 1 )q( 6 ) + p( 0 )q( 8 ) = = 5 x 1 + 3 x 1 + 2 x 2 + 1 x 4 + 1 x 6 = 22 p( 9 ) = \sum ^{4} _{k =0} p( 4 - k)q( 2 k + 1 ) = = p( 4 )q( 1 ) + p( 3 )q( 3 ) + p( 2 )q( 5 ) + p( 1 )q( 7 ) + p( 0 )q( 9 ) = = 5 x 1 + 3 x 2 + 2 x 3 + 1 x 5 + 1 x 8 = 30

Restricted partition function

More generally, it is possible to consider partitions restricted to only elements of a subset A of the natural numbers (for example a restriction on the maximum value of the parts), or with a restriction on the number of parts or the maximum difference between parts. Each particular restriction gives rise to an associated partition function with specific properties. Some common examples are given below.

Euler and Glaisher's theorem

Two important examples are the partitions restricted to only odd integer parts or only even integer parts, with the corresponding partition functions often denoted

p _{o(n)} and p _{e(n)} .

A theorem from Euler shows that the number of strict partitions is equal to the number of partitions with only odd parts: for all n,

q(n) = p _{o(n)} . This is generalized as Glaisher's theorem, which states that the number of partitions with no more than d-1 repetitions of any part is equal to the number of partitions with no part divisible by d.

Gaussian binomial coefficient

If we denote

p(N, M, n) the number of partitions of n in at most M parts, with each part smaller or equal to N, then the generating function of p(N, M, n) is the following Gaussian binomial coefficient:\sum ^{inf ty} _{n =0} p(N, M, n)q ^{n} = {N + M \choose M} _{q = (( 1- q ^{N+M} )( 1- q ^{N+M-1} ) … ( 1- q ^{N+1} ))/(( 1- q)( 1- q ^{2) … (1-q} ^{M)})}

Asymptotics

Some general results on the asymptotic properties of restricted partition functions are known. If p_A(n) is the partition function of partitions restricted to only elements of a subset A of the natural numbers, then:

If A possesses positive natural density α then

log p _{A(n)} \sim C \sqrt{\alpha n} , with C = \pi\sqrt (23)/()

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

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

p _{A(n)} = \left(\prod _{a} a ^{-1} \right) ⋅ (n ^{k-1})/((k -1 )!) + O(n ^{k-2} ) .

External links

• First 4096 values of the partition function

Notes and References

1. Book: Stanley, Richard P.. Richard P. Stanley. Enumerative Combinatorics 1 . Cambridge Studies in Advanced Mathematics. 49. Cambridge University Press. 0-521-66351-2 . 1997. Proposition 1.8.5.
2. Book: Stanley, Richard P.. Richard P. Stanley. Enumerative Combinatorics 1 . Cambridge Studies in Advanced Mathematics. 49. Cambridge University Press. 0-521-66351-2 . 1997. Proof of Proposition 1.8.5.