Dyson’s crank of a partition (Q3789634)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4053714
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dyson’s crank of a partition |
scientific article; zbMATH DE number 4053714 |
Statements
Dyson’s crank of a partition (English)
0 references
1988
0 references
congruences
0 references
rank
0 references
crank of ordinary partition
0 references
number of vector partitions
0 references
0.8777158856391907
0 references
0.8774172067642212
0 references
0.8720335960388184
0 references
0.8649812340736389
0 references
0.8629626631736755
0 references
\textit{F. J. Dyson} [Eureka 8, 10--15 (1944)] defined the rank of a partition as the largest part minus the number of parts. Let \(N(m,t,n)\) denote the number of partitions of \(n\) of rank congruent to \(m \mod t\). Dyson conjectured and \textit{A. O. L. Atkin} and \textit{P. Swinnerton-Dyer} [Proc. Lond. Math. Soc. (3) 4, 84--106 (1954; Zbl 0055.03805)] proved that \[ N(m,5,5n+4)=\frac 15 p(5n+4),\;0\leq m\leq 4;\quad N(m,7,7n+5)=\frac 17\;p(7n+5),\;0\leq m\leq 6; \] where \(p(n)\) denotes the number of partitions of \(n\). Dyson also observed that the rank did not separate the partitions of \(11n+6\) into \(11\) equal classes although Ramanujan's conjecture \(p(11n+6)\equiv 0 \pmod{11}\) holds. He conjectured the existence of a crank for the proof of this conjecture. \textit{F. G. Garvan} [Trans. Am. Math. Soc. 322, No. 1, 79--94 (1990; Zbl 0717.11042)] defined the crank relative to certain vector partitions of \(n\) to prove all these conjectures. In this article the authors define the crank of ordinary partition of \(n\) denoted by \(c(\pi)\). Let \(N_ v(m,n)\) denote the number of vector partitions of \(n\) with crank \(m\). It is proved that the number of partitions of \(n\) with \(c(\pi)=m\) is equal to \(N_ v(m,n)\) for all \(n>1\).
0 references