Asymptotic Inequalities for Positive Crank and Rank Moments
نویسندگان
چکیده
Andrews, Chan, and Kim recently introduced a modified definition of crank and rank moments for integer partitions that allows the study of both even and odd moments. In this paper, we prove the asymptotic behavior of these moments in all cases. Our main result states that the two families of moment functions are asymptotically equal, but the crank moments are also asymptotically larger than the rank moments. Andrews, Chan, and Kim also gave a combinatorial description for the differences of the first crank and rank moments that they named the ospt-function. Our main results therefore also give the asymptotic behavior of the ospt-function (and its analogs for higher moments), and we further determine the behavior of the ospt-function modulo 2 by relating its parity to Andrews’ spt-function.
منابع مشابه
Inequalities Between Ranks and Cranks
Higher 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 the first several cases of (and strengthens) a conjecture due to Garvan, which states that the moments of the crank function are always larger than the moments of the crank f...
متن کامل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 due to two of the authors that re ned a conjecture of Garvan. Garvan's original conjecture states that the moments of the crank function are always larger than the mome...
متن کاملTaylor Coefficients of Mock-jacobi Forms and Moments of Partition Statistics
We develop a new technique for deriving asymptotic series expansions for moments of combinatorial generating functions that uses the transformation theory of Jacobi forms and “mock” Jacobi forms, as well as the Hardy-Ramanujan Circle Method. The approach builds on a suggestion of Zagier, who observed that the moments of a combinatorial statistic can be simultaneously encoded as the Taylor coeff...
متن کاملThe First Positive Rank and Crank Moments for Overpartitions
In 2003, Atkin and Garvan initiated the study of rank and crank moments for ordinary partitions. These moments satisfy a strict inequality. We prove that a strict inequality also holds for the first rank and crank moments of overpartitions and consider a new combinatorial interpretation in this setting.
متن کاملRank and Crank Moments for Overpartitions
We study two types of crank moments and two types of rank moments for overpartitions. We show that the crank moments and their derivatives, along with certain linear combinations of the rank moments and their derivatives, can be written in terms of quasimodular forms. We then use this fact to prove exact relations involving the moments as well as congruence properties modulo 3, 5, and 7 for som...
متن کامل