# Asymptotics for rank and crank moments

Source: [Asymptotics for rank and crank moments](<https://www.sota2.com/research/paper/68fa50b81e209131ce96ddb8>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-28T13:55:31.082Z

Authors: K. Bringmann, K. Mahlburg, R. Rhoades

Published: 2009-03-06T21:28:46.000Z

## Abstract

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 due to Bringmann and Mahlburg that refined a conjecture of Garvan. Garvan's 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 proof uses the Hardy-Ramanujan method to provide precise asymptotic estimates for rank and crank moments and their differences.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/0903.1297>)

[PDF](<https://arxiv.org/pdf/0903.1297.pdf>)