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
Andrews, Garvan and Liang introduced the spt-crank for vector partitions. We conjecture that for any...
Let spt(n) denote the total number of appearances of the smallest parts in all the partitions of n. ...
Asymptotic formulas for the positive moments of rank and crank of partitions were obtained by K. Bri...
AbstractAndrewsʼ spt-function can be written as the difference between the second symmetrized crank ...
Abstract. Higher moments of the partition rank and crank statistics have been studied for their conn...
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. ...
Higher moments of the partition rank and crank statistics have been studied for their connections to...
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...
AbstractIn this paper, we modify the standard definition of moments of ranks and cranks such that od...
Let spt (n) denote the total number of appearances of the smallest part in each partition of n. In 1...
In 2003, Atkin and Garvan initiated the study of rank and crank moments for ordinary partitions. The...
In 2003, Atkin and Garvan initiated the study of rank and crank moments for ordinary partitions. The...
In 1916, Ramanujan’s showed the spt-crank for marked overpartitions. The corresponding special funct...
Andrews, Garvan and Liang introduced the spt-crank for vector partitions. We conjecture that for any...
Let spt(n) denote the total number of appearances of the smallest parts in all the partitions of n. ...
Asymptotic formulas for the positive moments of rank and crank of partitions were obtained by K. Bri...
AbstractAndrewsʼ spt-function can be written as the difference between the second symmetrized crank ...
Abstract. Higher moments of the partition rank and crank statistics have been studied for their conn...
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. ...
Higher moments of the partition rank and crank statistics have been studied for their connections to...
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...
AbstractIn this paper, we modify the standard definition of moments of ranks and cranks such that od...
Let spt (n) denote the total number of appearances of the smallest part in each partition of n. In 1...
In 2003, Atkin and Garvan initiated the study of rank and crank moments for ordinary partitions. The...
In 2003, Atkin and Garvan initiated the study of rank and crank moments for ordinary partitions. The...
In 1916, Ramanujan’s showed the spt-crank for marked overpartitions. The corresponding special funct...
Andrews, Garvan and Liang introduced the spt-crank for vector partitions. We conjecture that for any...
Let spt(n) denote the total number of appearances of the smallest parts in all the partitions of n. ...
Asymptotic formulas for the positive moments of rank and crank of partitions were obtained by K. Bri...