Title of article :
The odd moments of ranks and cranks
Author/Authors :
Andrews، نويسنده , , George E. and Chan، نويسنده , , Song Heng and Kim، نويسنده , , Byungchan، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2013
Abstract :
In this paper, we modify the standard definition of moments of ranks and cranks such that odd moments no longer trivially vanish. Denoting the new k-th rank (resp. crank) moments by N ¯ k ( n ) (resp. M ¯ k ( n ) ), we prove the following inequality between the first rank and crank moments: M ¯ 1 ( n ) > N ¯ 1 ( n ) . This inequality motivates us to study a new counting function, ospt ( n ) , which is equal to M ¯ 1 ( n ) − N ¯ 1 ( n ) . We also discuss higher order moments of ranks and cranks. Surprisingly, for every higher order moments of ranks and cranks, the following inequality holds: M ¯ k ( n ) > N ¯ k ( n ) . This extends F.G. Garvanʼs result on the ordinary moments of ranks and cranks.
Keywords :
partitions , Rank , Crank , Rank moments , Crank moments , strings , Smallest part function
Journal title :
Journal of Combinatorial Theory Series A
Journal title :
Journal of Combinatorial Theory Series A