Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Hecke-type congruences for two smallest parts functions (1209.4009v1)

Published 18 Sep 2012 in math.NT

Abstract: We prove infinitely many congruences modulo 3, 5, and powers of 2 for the overpartition function $\bar{p}(n)$ and two smallest parts functions: $\bar{\operatorname{spt1}}(n)$ for overpartitions and $\operatorname{M2spt}(n)$ for partitions without repeated odd parts. These resemble the Hecke-type congruences found by Atkin for the partition function $p(n)$ in 1966 and Garvan for the smallest parts function $\operatorname{spt}(n)$ in 2010. The proofs depend on congruences between the generating functions for $\bar{p}(n)$, $\bar{\operatorname{spt1}}(n),$ and $\operatorname{M2spt}(n)$ and eigenforms for the half-integral weight Hecke operator $T(\ell{2})$.

Summary

We haven't generated a summary for this paper yet.