Transactions of the American Mathematical Society · 2013 · 49 citations · 25 references
Natural SciencesMathematicsCombinatoricsNumber TheoryProbability TheoryCombinatorial Number TheoryMethod Of MomentsProbability InequalitiesAsymptotic ExpansionsAsymptotic TheoryHigher-order MomentsMoment-generating FunctionsMoments
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 <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="2"> <mml:semantics> <mml:mn>2</mml:mn> <mml:annotation encoding="application/x-tex">2</mml:annotation> </mml:semantics> </mml:math> </inline-formula> by relating its parity to Andrews’ spt-function.
25
George E. Andrews, Frank Garvan · Bulletin of the American Mathematical Society · 1988 · 385 citations · Full text
Kathrin Bringmann, Ken Ono · Annals of Mathematics · 2010 · 212 citations · Full text