Asymptotics for rank and crank moments

Details Asymptotics for rank and crank moments Asymptotics for rank and crank moments

2009-03-06

arxiv.org/abs/0903.1297v1

Mathematics

Number Theory

11 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Asymptotics for rank and crank moments does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Asymptotics for rank and crank moments, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotics for rank and crank moments will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-670565