AbstractIn 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
AbstractGarvan noted that some “curious” relations hold between the numbers N(r, m; n) and M(r, m; n...
Asymptotic formulas for the positive moments of rank and crank of partitions were obtained by K. Bri...
Let $N_k(m,n)$ denote the number of partitions of $n$ with Garvan $k$-rank $m$. It is well-known tha...
AbstractIn this paper, we modify the standard definition of moments of ranks and cranks such that od...
In this paper, we modify the standard definition of moments of ranks and cranks such that odd moment...
AbstractWe study two types of crank moments and two types of rank moments for overpartitions. We sho...
We study two types of crank moments and two types of rank moments for overpartitions. We show that t...
In 2003, Atkin and Garvan initiated the study of rank and crank moments for ordinary partitions. The...
Abstract. Higher moments of the partition rank and crank statistics have been studied for their conn...
Higher moments of the partition rank and crank statistics have been studied for their connections to...
In 2003, Atkin and Garvan initiated the study of rank and crank moments for ordinary partitions. The...
AbstractAndrewsʼ spt-function can be written as the difference between the second symmetrized crank ...
This is an author's peer-reviewed final manuscript, as accepted by the publisher. The published arti...
AbstractWe discuss inequalities between the rank counts N(r, m, n) and between the crank counts M(r,...
AbstractThe ‘crank’ is a partition statistic which originally arose to give combinatorial interpreta...
AbstractGarvan noted that some “curious” relations hold between the numbers N(r, m; n) and M(r, m; n...
Asymptotic formulas for the positive moments of rank and crank of partitions were obtained by K. Bri...
Let $N_k(m,n)$ denote the number of partitions of $n$ with Garvan $k$-rank $m$. It is well-known tha...
AbstractIn this paper, we modify the standard definition of moments of ranks and cranks such that od...
In this paper, we modify the standard definition of moments of ranks and cranks such that odd moment...
AbstractWe study two types of crank moments and two types of rank moments for overpartitions. We sho...
We study two types of crank moments and two types of rank moments for overpartitions. We show that t...
In 2003, Atkin and Garvan initiated the study of rank and crank moments for ordinary partitions. The...
Abstract. Higher moments of the partition rank and crank statistics have been studied for their conn...
Higher moments of the partition rank and crank statistics have been studied for their connections to...
In 2003, Atkin and Garvan initiated the study of rank and crank moments for ordinary partitions. The...
AbstractAndrewsʼ spt-function can be written as the difference between the second symmetrized crank ...
This is an author's peer-reviewed final manuscript, as accepted by the publisher. The published arti...
AbstractWe discuss inequalities between the rank counts N(r, m, n) and between the crank counts M(r,...
AbstractThe ‘crank’ is a partition statistic which originally arose to give combinatorial interpreta...
AbstractGarvan noted that some “curious” relations hold between the numbers N(r, m; n) and M(r, m; n...
Asymptotic formulas for the positive moments of rank and crank of partitions were obtained by K. Bri...
Let $N_k(m,n)$ denote the number of partitions of $n$ with Garvan $k$-rank $m$. It is well-known tha...