Cranks and t-cores.
Generalizations of Dyson's rank and non-Rogers-Ramanujan partitions.
Qseries Maple tutorial: A -product tutorial for a -series Maple package.
The spt-crank for overpartitions
Bringmann, Lovejoy, and Osburn (2009, 2010) showed that the generating functions of the spt-overpartition functions , , , and M2spt(n) are quasimock theta functions, and satisfy a number of simple Ramanujan-like congruences. Andrews, Garvan, and Liang (2012) defined an spt-crank in terms of weighted vector partitions which combinatorially explain simple congruences modulo 5 and 7 for spt(n). Chen, Ji, and Zang (2013) were able to define this spt-crank in terms of ordinary partitions. In this...
Self-conjugate vector partitions and the parity of the spt-function
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,...
Page 1