Rank of a partition

Last updated March 02, 2024

In mathematics, particularly in the fields of number theory and combinatorics, the rank of an integer partition is a certain number associated with the partition. In fact at least two different definitions of rank appear in the literature. The first definition, with which most of this article is concerned, is that the rank of a partition is the number obtained by subtracting the number of parts in the partition from the largest part in the partition. The concept was introduced by Freeman Dyson in a paper published in the journal Eureka.^[1] It was presented in the context of a study of certain congruence properties of the partition function discovered by the Indian mathematical genius Srinivasa Ramanujan. A different concept, sharing the same name, is used in combinatorics, where the rank is taken to be the size of the Durfee square of the partition.

Definition

By a partition of a positive integer n we mean a finite multiset λ = { λ_k, λ_{k− 1}, . . . , λ₁ } of positive integers satisfying the following two conditions:

λ_k≥ . . . ≥λ₂≥λ₁ > 0.
λ_k + . . . + λ₂ + λ₁ = n.

If λ_k, . . . , λ₂, λ₁ are distinct, that is, if

λ_k > . . . > λ₂ > λ₁ > 0

then the partition λ is called a strict partition of n. The integers λ_k, λ_{k− 1}, ..., λ₁ are the parts of the partition. The number of parts in the partition λ is k and the largest part in the partition is λ_k. The rank of the partition λ (whether ordinary or strict) is defined as λ_k−k.^[1]

The ranks of the partitions of n take the following values and no others:^[1]

n− 1, n−3, n−4, . . . , 2, 1, 0, −1, −2, . . . , −(n− 4), −(n− 3), −(n− 1).

The following table gives the ranks of the various partitions of the number 5.

Ranks of the partitions of the integer 5

Partition (λ)	Largest part (λ_k)	Number of parts (k)	Rank of the partition (λ_k−k )
{ 5 }	5	1	4
{ 4, 1 }	4	2	2
{ 3, 2 }	3	2	1
{ 3, 1, 1 }	3	3	0
{ 2, 2, 1 }	2	3	−1
{ 2, 1, 1, 1 }	2	4	−2
{ 1, 1, 1, 1, 1 }	1	5	−4

Notations

The following notations are used to specify how many partitions have a given rank. Let n, q be a positive integers and m be any integer.

The total number of partitions of n is denoted by p(n).
The number of partitions of n with rank m is denoted by N(m, n).
The number of partitions of n with rank congruent to m modulo q is denoted by N(m, q, n).
The number of strict partitions of n is denoted by Q(n).
The number of strict partitions of n with rank m is denoted by R(m, n).
The number of strict partitions of n with rank congruent to m modulo q is denoted by T(m, q, n).

For example,

p(5) = 7 , N(2, 5) = 1 , N(3, 5) = 0 , N(2, 2, 5) = 5 .

Q(5) = 3 , R(2, 5) = 1 , R(3, 5) = 0 , T(2, 2, 5) = 2.

Some basic results

Let n, q be a positive integers and m be any integer.^[1]

$N(m,n)=N(-m,n)$
$N(m,q,n)=N(q-m,q,n)$
$N(m,q,n)=\sum _{r=-\infty }^{\infty }N(m+rq,n)$

Ramanujan's congruences and Dyson's conjecture

Srinivasa Ramanujan in a paper published in 1919 proved the following congruences involving the partition function p(n):^[2]

p(5n + 4) ≡ 0 (mod 5)
p(7n + 5) ≡ 0 (mod 7)
p(11n + 6) ≡ 0 (mod 11)

In commenting on this result, Dyson noted that " . . . although we can prove that the partitions of 5n + 4 can be divided into five equally numerous subclasses, it is unsatisfactory to receive from the proofs no concrete idea of how the division is to be made. We require a proof which will not appeal to generating functions, . . . ".^[1] Dyson introduced the idea of rank of a partition to accomplish the task he set for himself. Using this new idea, he made the following conjectures:

N(0, 5, 5n + 4) = N(1, 5, 5n + 4) = N(2, 5, 5n + 4) = N(3, 5, 5n + 4) = N(4, 5, 5n + 4)
N(0, 7, 7n + 5) = N(1, 7, 7n + 5) = N(2, 7, 7n + 5) = . . . = N(6, 7, 7n + 5)

These conjectures were proved by Atkin and Swinnerton-Dyer in 1954.^[3]

The following tables show how the partitions of the integers 4 (5 × n + 4 with n = 0) and 9 (5 × n + 4 with n = 1 ) get divided into five equally numerous subclasses.

Partitions of the integer 4

Partitions with rank ≡ 0 (mod 5)	Partitions with rank ≡ 1 (mod 5)	Partitions with rank ≡ 2 (mod 5)	Partitions with rank ≡ 3 (mod 5)	Partitions with rank ≡ 4 (mod 5)
{ 2, 2 }	{ 3, 1 }	{ 1, 1, 1, 1 }	{ 4 }	{ 2, 1, 1 }

Partitions of the integer 9

Partitions with rank ≡ 0 (mod 5)	Partitions with rank ≡ 1 (mod 5)	Partitions with rank ≡ 2 (mod 5)	Partitions with rank ≡ 3 (mod 5)	Partitions with rank ≡ 4 (mod 5)
{ 7, 2 }	{ 8, 1 }	{ 6, 1, 1, 1 }	{ 9 }	{ 7, 1, 1 }
{ 5, 1, 1, 1, 1 }	{ 5, 2, 1, 1 }	{ 5, 3, 1}	{ 6, 2, 1 }	{ 6, 3 }
{ 4, 3, 1, 1 }	{ 4, 4, 1 }	{ 5, 2, 2 }	{ 5, 4 }	{ 4, 2, 1, 1, 1 }
{ 4, 2, 2, 1 }	{ 4, 3, 2 }	{ 3, 2, 1, 1, 1, 1 }	{ 3, 3, 1, 1, 1 }	{ 3, 3, 2, 1 }
{ 3, 3, 3 }	{ 3, 1, 1, 1, 1, 1, 1 }	{ 2, 2, 2, 2, 1 }	{ 4, 1, 1, 1, 1, 1 }	{ 3, 2, 2, 2 }
{ 2, 2, 1, 1, 1, 1, 1 }	{ 2, 2, 2, 1, 1, 1 }	{ 1, 1, 1, 1, 1, 1, 1, 1, 1 }	{ 3, 2, 2, 1, 1}	{ 2, 1, 1, 1, 1, 1, 1, 1 }

Generating functions

The generating function of p(n) was discovered by Euler and is well known.^[4]

\sum _{n=0}^{\infty }p(n)x^{n}=\prod _{k=1}^{\infty }{\frac {1}{1-x^{k}}}

The generating function for N(m, n) is given below:^[5]

\sum _{m=-\infty }^{\infty }\sum _{n=0}^{\infty }N(m,n)z^{m}q^{n}=1+\sum _{n=1}^{\infty }{\frac {q^{n^{2}}}{\prod _{k=1}^{n}(1-zq^{k})(1-z^{-1}q^{k})}}

The generating function for Q(n) is given below:^[6]

\sum _{n=0}^{\infty }Q(n)x^{n}=\prod _{k=0}^{\infty }{\frac {1}{1-x^{2k-1}}}

The generating function for R(m, n) is given below:^[6]

\sum _{m,n=0}^{\infty }R(m,n)z^{m}q^{n}=1+\sum _{s=1}^{\infty }{\frac {q^{s(s+1)/2}}{(1-zq)(1-zq^{2})\cdots (1-zq^{s})}}

Alternate definition

In combinatorics, the phrase rank of a partition is sometimes used to describe a different concept: the rank of a partition λ is the largest integer i such that λ has at least i parts each of which is no smaller than i.^[7] Equivalently, this is the length of the main diagonal in the Young diagram or Ferrers diagram for λ, or the side-length of the Durfee square of λ.

The table of ranks of partitions of 5 is given below.

Ranks of the partitions of the integer 5

Partition	Rank
{ 5 }	1
{ 4, 1 }	1
{ 3, 2 }	2
{ 3, 1, 1 }	1
{ 2, 2, 1 }	2
{ 2, 1, 1, 1 }	1
{ 1, 1, 1, 1, 1 }	1

Related Research Articles

In number theory, an arithmetic, arithmetical, or number-theoretic function is generally any function f(n) whose domain is the positive integers and whose range is a subset of the complex numbers. Hardy & Wright include in their definition the requirement that an arithmetical function "expresses some arithmetical property of n". There is a larger class of number-theoretic functions that do not fit this definition, for example, the prime-counting functions. This article provides links to functions of both classes.

In number theory and combinatorics, a partition of a non-negative 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. For example, $4$ can be partitioned in five distinct ways:

In mathematics, a generating function is a representation of an infinite sequence of numbers as the coefficients of a formal power series. Unlike an ordinary series, the formal power series is not required to converge: in fact, the generating function is not actually regarded as a function, and the "variable" remains an indeterminate. Generating functions were first introduced by Abraham de Moivre in 1730, in order to solve the general linear recurrence problem. One can generalize to formal power series in more than one indeterminate, to encode information about infinite multi-dimensional arrays of numbers.

In mathematics, a modular form is a (complex) analytic function on the upper half-plane, $, that satisfies:$

In number theory, the partition function $p (n)$ represents the number of possible partitions of a non-negative integer $n$ . For instance, $p (4) = 5$ because the integer 4 has the five partitions $1 + 1 + 1 + 1$ , $1 + 1 + 2$ , $1 + 3$ , $2 + 2$ , and $4$ .

In mathematics, Euler's pentagonal number theorem relates the product and series representations of the Euler function. It states that

In mathematics, smooth functions and analytic functions are two very important types of functions. One can easily prove that any analytic function of a real argument is smooth. The converse is not true, as demonstrated with the counterexample below.

In mathematics, in particular in the theory of modular forms, a Hecke operator, studied by Erich Hecke, is a certain kind of "averaging" operator that plays a significant role in the structure of vector spaces of modular forms and more general automorphic representations.

In mathematics, a Lambert series, named for Johann Heinrich Lambert, is a series taking the form

In mathematics, the von Mangoldt function is an arithmetic function named after German mathematician Hans von Mangoldt. It is an example of an important arithmetic function that is neither multiplicative nor additive.

In mathematics, Schur polynomials, named after Issai Schur, are certain symmetric polynomials in n variables, indexed by partitions, that generalize the elementary symmetric polynomials and the complete homogeneous symmetric polynomials. In representation theory they are the characters of polynomial irreducible representations of the general linear groups. The Schur polynomials form a linear basis for the space of all symmetric polynomials. Any product of Schur polynomials can be written as a linear combination of Schur polynomials with non-negative integral coefficients; the values of these coefficients is given combinatorially by the Littlewood–Richardson rule. More generally, skew Schur polynomials are associated with pairs of partitions and have similar properties to Schur polynomials.

The Minakshisundaram–Pleijel zeta function is a zeta function encoding the eigenvalues of the Laplacian of a compact Riemannian manifold. It was introduced by Subbaramiah Minakshisundaram and Åke Pleijel. The case of a compact region of the plane was treated earlier by Torsten Carleman.

In mathematics, Ramanujan's congruences are some remarkable congruences for the partition function p(n). The mathematician Srinivasa Ramanujan discovered the congruences

In analysis, a lacunary function, also known as a lacunary series, is an analytic function that cannot be analytically continued anywhere outside the radius of convergence within which it is defined by a power series. The word lacunary is derived from lacuna, meaning gap, or vacancy.

In the mathematical field of combinatorics, the q-Pochhammer symbol, also called the q-shifted factorial, is the product

In probability theory and statistics, the Poisson distribution is a discrete probability distribution that expresses the probability of a given number of events occurring in a fixed interval of time if these events occur with a known constant mean rate and independently of the time since the last event. It can also be used for the number of events in other types of intervals than time, and in dimension greater than 1.

The spt function is a function in number theory that counts the sum of the number of smallest parts in each partition of a positive integer. It is related to the partition function.

In mathematics, Minkowski's second theorem is a result in the geometry of numbers about the values taken by a norm on a lattice and the volume of its fundamental cell.

In number theory, the crank of an integer partition is a certain number associated with the partition. The term was first introduced without a definition by Freeman Dyson in a 1944 paper published in Eureka, a journal published by the Mathematics Society of Cambridge University. Dyson then gave a list of properties this yet-to-be-defined quantity should have. In 1988, George E. Andrews and Frank Garvan discovered a definition for the crank satisfying the properties hypothesized for it by Dyson.

Tau functions are an important ingredient in the modern mathematical theory of integrable systems, and have numerous applications in a variety of other domains. They were originally introduced by Ryogo Hirota in his direct method approach to soliton equations, based on expressing them in an equivalent bilinear form.

References

1 2 3 4 5 F. Dyson (1944). "Some guesses in the theory of partitions" (PDF). Eureka (Cambridge). 8: 10–15.
↑ Srinivasa, Ramanujan (1919). "Some properties of p(n), number of partitions of n". Proceedings of the Cambridge Philosophical Society. XIX: 207–210.
↑ A. O. L. Atkin; H. P. F. Swinnerton-Dyer (1954). "Some properties of partitions". Proceedings of the London Mathematical Society. 66 (4): 84–106. doi:10.1112/plms/s3-4.1.84.
↑ G.H. Hardy and E.W. Wright (1938). An introduction to the theory of numbers. London: Oxford University Press. p. 274.
↑ Bringmann, Kathrin (2009). "Congruences for Dyson's ranks" (PDF). International Journal of Number Theory. 5 (4): 573–584. doi:10.1142/S1793042109002262 . Retrieved 24 November 2012.
1 2 Maria Monks (2010). "Number theoretic properties of generating functions related to Dyson's rank for partitions into distinct parts" (PDF). Proceedings of the American Mathematical Society . 138 (2): 481–494. doi: 10.1090/s0002-9939-09-10076-x . Retrieved 24 November 2012.
↑ Stanley, Richard P. (1999) Enumerative Combinatorics, Volume 2, p. 289. Cambridge University Press. ISBN 0-521-56069-1.
↑ Bringman, Kathrin (July 2009). "Asymptotics For Rank Partition Functions" (PDF). Transactions of the American Mathematical Society. 361 (7): 3483–3500. arXiv: 0708.0691 . doi:10.1090/s0002-9947-09-04553-x. S2CID 42465633 . Retrieved 21 November 2012.
↑ Bringmann, Kathrin (2009). "Congruences for Dyson's rank" (PDF). International Journal of Number Theory. 5 (4): 573–584. doi:10.1142/S1793042109002262 . Retrieved 21 November 2012.
↑ Berkovich, Alexander; Garvan, Frank G. (2008). "The BG-rank of a partition and its applications" (PDF). Advances in Applied Mathematics. 40 (3): 377–400. arXiv: math/0602362 . doi:10.1016/j.aam.2007.04.002. S2CID 7337479 . Retrieved 21 November 2012.

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[Dyson-1] 1 2 3 4 5 F. Dyson (1944). "Some guesses in the theory of partitions" (PDF). Eureka (Cambridge). 8: 10–15.

[2] Srinivasa, Ramanujan (1919). "Some properties of p(n), number of partitions of n". Proceedings of the Cambridge Philosophical Society. XIX: 207–210.

[3] A. O. L. Atkin; H. P. F. Swinnerton-Dyer (1954). "Some properties of partitions". Proceedings of the London Mathematical Society. 66 (4): 84–106. doi:10.1112/plms/s3-4.1.84.

[4] G.H. Hardy and E.W. Wright (1938). An introduction to the theory of numbers. London: Oxford University Press. p. 274.

[5] Bringmann, Kathrin (2009). "Congruences for Dyson's ranks" (PDF). International Journal of Number Theory. 5 (4): 573–584. doi:10.1142/S1793042109002262 . Retrieved 24 November 2012.

[Maria-6] 1 2 Maria Monks (2010). "Number theoretic properties of generating functions related to Dyson's rank for partitions into distinct parts" (PDF). Proceedings of the American Mathematical Society . 138 (2): 481–494. doi: 10.1090/s0002-9939-09-10076-x . Retrieved 24 November 2012.

[7] Stanley, Richard P. (1999) Enumerative Combinatorics, Volume 2, p. 289. Cambridge University Press. ISBN 0-521-56069-1.

[8] Bringman, Kathrin (July 2009). "Asymptotics For Rank Partition Functions" (PDF). Transactions of the American Mathematical Society. 361 (7): 3483–3500. arXiv: 0708.0691 . doi:10.1090/s0002-9947-09-04553-x. S2CID 42465633 . Retrieved 21 November 2012.

[9] Bringmann, Kathrin (2009). "Congruences for Dyson's rank" (PDF). International Journal of Number Theory. 5 (4): 573–584. doi:10.1142/S1793042109002262 . Retrieved 21 November 2012.

[10] Berkovich, Alexander; Garvan, Frank G. (2008). "The BG-rank of a partition and its applications" (PDF). Advances in Applied Mathematics. 40 (3): 377–400. arXiv: math/0602362 . doi:10.1016/j.aam.2007.04.002. S2CID 7337479 . Retrieved 21 November 2012.

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]