On the distribution of rank and crank statistics for integer partitions
Nian Hong Zhou

TL;DR
This paper derives asymptotic formulas for Garvan's k-rank distribution in integer partitions, providing insights into Dyson's crank conjecture and analyzing finite differences for large m.
Contribution
It offers new asymptotic results for Garvan's k-rank distribution and advances understanding of Dyson's crank conjecture for large parameters.
Findings
Asymptotic formulas for N_k(m,n) when |m| ≥ √n as n→∞
Refined understanding of Dyson's crank distribution conjecture
Asymptotics for finite differences of N_k(m,n) with large m
Abstract
Let be a positive integer and be an integer. Garvan's -rank is the number of partitions of into at least successive Durfee squares with -rank equal to . In this paper give some asymptotics for with as . As a corollary, we give a more complete answer for the Dyson's crank distribution conjecture. We also establish some asymptotic formulas for finite differences of with respect to with .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
