Asymptotics for rank and crank moments

Moments of the partition rank and crank statistics have been studied for their connections to combinatorial objects such as Durfee symbols, as well as for their connections to harmonic Maass forms. This paper proves a conjecture of two of the authors that refined a conjecture of Garvan. Garvan's original conjecture states that the moments of the crank function are always larger than the moments of the rank function, even though the moments have the same main asymptotic term. The refined version provides precise asymptotic estimates for both the moments and their differences. Our proof uses the Hardy–Ramanujan Circle Method, multiple sums of Bernoulli polynomials and the theory of quasimock theta functions.