AbstractAndrewsʼ spt-function can be written as the difference between the second symmetrized crank and rank moment functions. Using the machinery of Bailey pairs a combinatorial interpretation is given for the difference between higher order symmetrized crank and rank moment functions. This implies an inequality between crank and rank moments that was only known previously for sufficiently large n and fixed order. This combinatorial interpretation is in terms of a weighted sum of partitions. A number of congruences for higher order spt-functions are derived
Abstract. In recent work, Andrews, Chan, and Kim extend a result of Gar-van about even rank and cran...
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...
AbstractAndrewsʼ spt-function can be written as the difference between the second symmetrized crank ...
We study two types of crank moments and two types of rank moments for overpartitions. We show that t...
AbstractIn this paper, we modify the standard definition of moments of ranks and cranks such that od...
AbstractWe study two types of crank moments and two types of rank moments for overpartitions. We sho...
Abstract. Higher moments of the partition rank and crank statistics have been studied for their conn...
In 2003, Atkin and Garvan initiated the study of rank and crank moments for ordinary partitions. The...
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...
Let spt(n) denote the total number of appearances of the smallest parts in all the partitions of n. ...
Let spt(n) denote the total number of appearances of the smallest parts in all the partitions of n. ...
In 2009, Bingmann, Lovejoy and Osburn have shown the generating function for spt2(n). In 2012, Andre...
Dyson's rank function and the Andrews--Garvan crank function famously givecombinatorial witnesses fo...
Abstract. In recent work, Andrews, Chan, and Kim extend a result of Gar-van about even rank and cran...
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...
AbstractAndrewsʼ spt-function can be written as the difference between the second symmetrized crank ...
We study two types of crank moments and two types of rank moments for overpartitions. We show that t...
AbstractIn this paper, we modify the standard definition of moments of ranks and cranks such that od...
AbstractWe study two types of crank moments and two types of rank moments for overpartitions. We sho...
Abstract. Higher moments of the partition rank and crank statistics have been studied for their conn...
In 2003, Atkin and Garvan initiated the study of rank and crank moments for ordinary partitions. The...
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...
Let spt(n) denote the total number of appearances of the smallest parts in all the partitions of n. ...
Let spt(n) denote the total number of appearances of the smallest parts in all the partitions of n. ...
In 2009, Bingmann, Lovejoy and Osburn have shown the generating function for spt2(n). In 2012, Andre...
Dyson's rank function and the Andrews--Garvan crank function famously givecombinatorial witnesses fo...
Abstract. In recent work, Andrews, Chan, and Kim extend a result of Gar-van about even rank and cran...
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...