Proceedings of the National Academy of Sciences · 2005 · 67 citations · 6 references
Natural SciencesMathematicsDiscrete MathematicsNumber TheoryTheory Of ComputationCombinatorial Number TheoryCombinatorial Set TheoryGenerating FunctionsNumber-theoretic AlgorithmsCombinatorial Proof TechniquesPartition CongruencesPartition Function
In 1944, Freeman Dyson conjectured the existence of a "crank" function for partitions that would provide a combinatorial proof of Ramanujan's congruence modulo 11. Forty years later, Andrews and Garvan successfully found such a function and proved the celebrated result that the crank simultaneously "explains" the three Ramanujan congruences modulo 5, 7, and 11. This note announces the proof of a conjecture of Ono, which essentially asserts that the elusive crank satisfies exactly the same types of general congruences as the partition function.
6
George E. Andrews, Frank Garvan · Bulletin of the American Mathematical Society · 1988 · 385 citations · Full text
Distribution of the Partition Function Modulo m
Ken Ono · Annals of Mathematics · 2000 · 203 citations