2012
DOI: 10.1090/s0002-9947-2012-05702-3
|View full text |Cite
|
Sign up to set email alerts
|

The partition function modulo prime powers

Abstract: Let ≥ 5 be prime, let m ≥ 1 be an integer, and let p(n) denote the partition function. Folsom, Kent, and Ono recently proved that there exists a positive integer b (m) of size roughly m 2 such that the module formed from the Z/ m Z-span of generating functions for p b n+1 24 with odd b ≥ b (m) has finite rank. The same result holds with "odd" b replaced by "even" b. Furthermore, they proved an upper bound on the ranks of these modules. This upper bound is independent of m; it is +12 24. In this paper, we prove… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
22
0

Year Published

2012
2012
2017
2017

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(23 citation statements)
references
References 36 publications
1
22
0
Order By: Relevance
“…Here, we give numerical examples of the main theorems in this paper. In all cases, using the methods in §6 of [6], we find that d (r) and d (spt) are zero.…”
Section: 2mentioning
confidence: 84%
See 4 more Smart Citations
“…Here, we give numerical examples of the main theorems in this paper. In all cases, using the methods in §6 of [6], we find that d (r) and d (spt) are zero.…”
Section: 2mentioning
confidence: 84%
“…Proof. The proof is similar to that of Lemma 3.1 in [6], so we will omit some details and instead note the differences. For (1), we let g j denote the forms in M k (spt,j) congruent to Ψ modulo j , and for (2), we let g j denote the forms in M j−1 ( −1) congruent to Ψ modulo and modulo j , respectively.…”
Section: 2mentioning
confidence: 96%
See 3 more Smart Citations