Let spt(n) denote the total number of appearances of the smallest parts in all the partitions of n. Recently, we found new combinatorial interpretations of congruences for the spt-function modulo 5 and 7. These interpretations were in terms of a restricted set of weighted vector partitions which we call S-partitions. We prove that the number of self-conjugate S-partitions, counted with a certain weight, is related to the coefficients of a certain mock theta function studied by the first author, Dyson and Hickerson. As a result we obtain an elementary q-series proof of Ono and Folsom's results for the parity of spt(n). A number of related generating function identities are also obtained
We denote by spt(n) the total number of appearances of the small-est part in each integer partition ...
The partition function counts the number of ways a positive integer can be written as the sum of a n...
We present two analogues of two well-known elementary arguments for a lower bound for p(n), the numb...
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 2013, Andrews, Garvan and Liang defined Self-conjugate S-partitions. In 2011, Andrews stated the ...
Let spt (n) denote the total number of appearances of the smallest part in each partition of n. In 1...
Andrews, Garvan and Liang introduced the spt-crank for vector partitions. We conjecture that for any...
This thesis focuses on the rank statistic of partition functions, congruences and relating identitie...
Ankara : The Department of Mathematics and the Graduate School of Engineering and Science of Bilkent...
AbstractA conjecture on the monotonicity of t-core partitions in an article of Stanton [Dennis Stant...
In 1916, Ramanujan’s showed the spt-crank for marked overpartitions. The corresponding special funct...
Integer partitions play important roles in diverse areas of mathematics such as q-series, the theory...
AbstractIn this work, we give combinatorial proofs for generating functions of two problems, i.e., f...
The generating function of partitions with repeated (resp. distinct) parts such that each odd part i...
We denote by spt(n) the total number of appearances of the small-est part in each integer partition ...
The partition function counts the number of ways a positive integer can be written as the sum of a n...
We present two analogues of two well-known elementary arguments for a lower bound for p(n), the numb...
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 2013, Andrews, Garvan and Liang defined Self-conjugate S-partitions. In 2011, Andrews stated the ...
Let spt (n) denote the total number of appearances of the smallest part in each partition of n. In 1...
Andrews, Garvan and Liang introduced the spt-crank for vector partitions. We conjecture that for any...
This thesis focuses on the rank statistic of partition functions, congruences and relating identitie...
Ankara : The Department of Mathematics and the Graduate School of Engineering and Science of Bilkent...
AbstractA conjecture on the monotonicity of t-core partitions in an article of Stanton [Dennis Stant...
In 1916, Ramanujan’s showed the spt-crank for marked overpartitions. The corresponding special funct...
Integer partitions play important roles in diverse areas of mathematics such as q-series, the theory...
AbstractIn this work, we give combinatorial proofs for generating functions of two problems, i.e., f...
The generating function of partitions with repeated (resp. distinct) parts such that each odd part i...
We denote by spt(n) the total number of appearances of the small-est part in each integer partition ...
The partition function counts the number of ways a positive integer can be written as the sum of a n...
We present two analogues of two well-known elementary arguments for a lower bound for p(n), the numb...