{"paper":{"title":"Another proof of two modulo 3 congruences and another SPT crank for the number of smallest parts in overpartitions with even smallest part","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Chris Jennings-Shaffer","submitted_at":"2014-06-20T16:40:18Z","abstract_excerpt":"By considering the $M_2$-rank of an overpartition as well as a residual crank, we give another combinatorial refinement of the congruences $\\overline{\\mbox{spt}}_2(3n)\\equiv \\overline{\\mbox{spt}}_2(3n+1)\\equiv 0\\pmod{3}$. Here $\\overline{\\mbox{spt}}_2(n)$ is the total number of occurrences of the smallest parts among the overpartitions of $n$ where the smallest part is even and not overlined. Our proof depends on Bailey's Lemma and the rank difference formulas of Lovejoy and Osburn for the $M_2$-rank of an overpartition. This congruence, along with a modulo $5$ congruence, has previously been "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5458","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}