Glaisher's Theorem

In number theory, Glaisher's theorem is an identity useful to the study of integer partitions. Proved in 1883 by James Whitbread Lee Glaisher, it states that the number of partitions of an integer $n$ into parts not divisible by $d$ is equal to the number of partitions in which no part is repeated $d$ or more times. This generalizes a result established in 1748 by Leonhard Euler for the case $d=2$.

Statement

It states that the number of partitions of an integer $n$ into parts not divisible by $d$ is equal to the number of partitions in which no part is repeated ''d'' or more times, which can be written formally as partitions of the form $n=\lambda_1+\cdots+\lambda_k$ where $\lambda_i\geq \lambda_$ and $\lambda_i\geq \lambda_+1$.

When $d=2$ this becomes the special case known as Euler's theorem, that the number of partitions of $n$ into distinct parts is equal to the number of partitions of $n$ into odd parts.

In the following examples, we use the multiplicity notation of partitions. For example, $1^4 2^1 3^2$ is a notation for the partition 1 + 1 + 1 + 1 + 2 + 3 + 3.

Example for ''d'' = 2 (Euler's theorem case)

Among the 15 partitions of the number 7, there are 5, shown in bold below, that contain only ''odd parts'' (i.e. only odd numbers):

$\mathbf, 6^1 1^1, 5^1 2^1, \mathbf, 4^1 3^1, 4^1 2^1 1^1, 4^1 1^3, \mathbf, 3^1 2^2, 3^1 2^1 1^2, \mathbf, 2^3 1^1, 2^2 1^3, 2^1 1^5, \mathbf$

If we count now the partitions of 7 with distinct parts (i.e. where no number is repeated), we also obtain 5:

$\mathbf, \mathbf, \mathbf, 5^1 1^2, \mathbf, \mathbf, 4^1 1^3, 3^2 1^1, 3^1 2^2, 3^1 2^1 1^2, 3^1 1^4, 2^3 1^1, 2^2 1^3, 2^1 1^5, 1^7$

The partitions in bold in the first and second case are not the same, and it is not obvious why their number is the same.

Example for ''d'' = 3

Among the 11 partitions of the number 6, there are 7, shown in bold below, that contain only parts not divisible by 3:

$6, \mathbf, \mathbf, \mathbf, 3^2, 3^1 2^1 1^1, 3^1 1^3, \mathbf, \mathbf, \mathbf, \mathbf$

And if we count the partitions of 6 with no part that repeats more than 2 times, we also obtain 7:
$\mathbf, \mathbf, \mathbf, \mathbf, \mathbf, \mathbf, 3^1 1^3, 2^3, \mathbf, 2^1 1^4, 1^6$

Proof

A proof of the theorem can be obtained with generating functions. If we note $p_d(n)$ the number of partitions with no parts divisible by ''d'' and $q_d(n)$ the number of partitions with no parts repeated more than ''d-1'' times, then the theorem means that for all n $p_d(n)=q_d(n)$. The uniqueness of ordinary generating functions implies that instead of proving that $p_d(n)=q_d(n)$ for all n, it suffices to prove that the generating functions of $p_d(n)$ and $q_d(n)$ are equal, i.e. that $\sum_^\infty p_d(n)x^n = \sum_^\infty q_d(n)x^n$.

Each generating function can be rewritten as infinite products (with a method similar to the infinite product of the partition function) :
: $\sum_^\infty p_d(n)x^n = \prod_^\infty\frac$ (i.e. the product of terms where ''n'' is not divisible by ''d'').
: $\sum_^\infty q_d(n)x^n = \prod_^\infty\frac$

If we expand the infinite product for $q_d(n)$:

:$\prod_^\infty\frac =\frac\frac\dots\frac\dots$

we see that each term in the numerator cancels with the corresponding multiple of ''d'' in the denominator. What remains after canceling all the numerator terms is exactly the infinite product for $p_d(n)$.

Hence the generating functions for $p_d(n)$ and $q_d(n)$ are equal.

Rogers–Ramanujan identities

If instead of counting the number of partitions with distinct parts we count the number of partitions with parts differing by at least 2, a further generalization is possible. It was first discovered by Leonard James Rogers in 1894, and then independently by Srinivasa Ramanujan in 1913 and Issai Schur in 1917, in what are now known as the Rogers–Ramanujan identities. They state that:

:1) The number of partitions whose parts differ by at least 2 is equal to the number of partitions involving only numbers congruent to 1 or 4 (mod 5).
:2) The number of partitions whose parts differ by at least 2 and with the smallest part at least 2 is equal to the number of partitions involving only numbers congruent to 2 or 3 (mod 5).

Example 1

For example, there are only 3 partitions of 7, shown in bold below, into parts differing by at least 2 (note: if a number is repeated in a partition, it means a difference of 0 between two parts, hence the partition is not counted):

$\mathbf, \mathbf, \mathbf, 5^1 1^2, 4^1 3^1, 4^1 2^1 1^1, 4^1 1^3, 3^2 1^1, 3^1 2^2, 3^1 2^1 1^2, 3^1 1^4, 2^3 1^1, 2^2 1^3, 2^1 1^5, 1^7$

And there are also only 3 partitions of 7 involving only the parts 1, 4, 6:

$7, \mathbf, 5^1 2^1, 5^1 1^2, 4^1 3^1, 4^1 2^1 1^1, \mathbf, 3^2 1^1, 3^1 2^2, 3^1 2^1 1^2, 3^1 1^4, 2^3 1^1, 2^2 1^3, 2^1 1^5, \mathbf$

Example 2

For an example of the second statement of the Rogers-Ramanujan identities, we consider partitions of 7 with the further restriction of the smallest part at least 2, and there are only 2, shown in bold below:

$\mathbf, 6^1 1^1, \mathbf, 5^1 1^2, 4^1 3^1, 4^1 2^1 1^1, 4^1 1^3, 3^2 1^1, 3^1 2^2, 3^1 2^1 1^2, 3^1 1^4, 2^3 1^1, 2^2 1^3, 2^1 1^5, 1^7$

And there are also only 2 partitions of 7 involving only the parts 2, 3, 7:

$\mathbf, 6^1 1^1, 5^1 2^1, 5^1 1^2, 4^1 3^1, 4^1 2^1 1^1, 4^1 1^3, 3^2 1^1, \mathbf, 3^1 2^1 1^2, 3^1 1^4, 2^3 1^1, 2^2 1^3, 2^1 1^5, 1^7$

Notes

References

*{{cite journal , author=D. H. Lehmer , authorlink=Derrick Henry Lehmer , title=Two nonexistence theorems on partitions , journal= Bull. Amer. Math. Soc. , volume=52 , issue=6 , year=1946 , pages=538–544 , url=http://projecteuclid.org/euclid.bams/1183509416 , doi=10.1090/S0002-9904-1946-08605-X , doi-access=free

Theorems in number theory
Glaisher family
Integer partitions