On the distribution of rank and crank statistics for integer partitions
Abstract
Let k be a positive integer and m be an integer. Garvan's k-rank Nk(m,n) is the number of partitions of n into at least (k-1) successive Durfee squares with k-rank equal to m. In this paper give some asymptotics for Nk(m,n) with |m| n as n→ ∞. 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 Nk(m,n) with respect to m with m n n.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.