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 paper we define spt-cranks in terms of vector partitions that combinatorially explain the known simple congruences for all the spt-overpartition functions as well as new simple congruences. For all the overpartition functions except M2spt(n) we are able to define the spt-crank purely in terms of marked overpartitions. The proofs of the congruences depend on Bailey’s Lemma and the difference formulas for the Dyson rank of an overpartition (Lovejoy and Osburn, 2008) and the -rank of a partition without repeated odd parts (Lovejoy and Osburn, 2009).
@article{bwmeta1.element.bwnjournal-article-doi-10_4064-aa166-2-3,
author = {Frank G. Garvan and Chris Jennings-Shaffer},
title = {The spt-crank for overpartitions},
journal = {Acta Arithmetica},
volume = {166},
year = {2014},
pages = {141-188},
zbl = {1316.11093},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-aa166-2-3}
}
Frank G. Garvan; Chris Jennings-Shaffer. The spt-crank for overpartitions. Acta Arithmetica, Tome 166 (2014) pp. 141-188. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-aa166-2-3/