2013
DOI: 10.1007/s11139-013-9485-z
|View full text |Cite
|
Sign up to set email alerts
|

Congruences of multipartition functions modulo powers of primes

Abstract: Let p r (n) denote the number of r-component multipartitions of n, and let S γ,λ be the space spanned by η(24z) γ φ(24z), where η(z) is the Dedekind's eta function and φ(z) is a holomorphic modular form in M λ (SL 2 (Z)). In this paper, we show that the generating function of p r ( m k n+r 24 ) with respect to n is congruent to a function in the space S γ,λ modulo m k . As special cases, this relation leads to many well known congruences including the Ramanujan congruences of p(n) modulo 5, 7, 11 and Gandhi's … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
7
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 9 publications
(7 citation statements)
references
References 29 publications
(68 reference statements)
0
7
0
Order By: Relevance
“…To make this paper self-contained, we recall some definitions and notation on half-integral weight modular forms. For more details, see [3,14,[19][20][21].…”
Section: Preliminariesmentioning
confidence: 99%
See 2 more Smart Citations
“…To make this paper self-contained, we recall some definitions and notation on half-integral weight modular forms. For more details, see [3,14,[19][20][21].…”
Section: Preliminariesmentioning
confidence: 99%
“…Based on the Hecke operator on φ(q) 3 and the fact that φ(q) 3 is a Hecke eigenform in M3 2 (Γ 0 (4)), we obtain a family of congruences for overpartitions modulo 5.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Later on, Chen et al [5,Eq. (1.17)] proved the following congruence modulo 25 for p −2 (n) via modular forms: p −2 (25n + 23) ≡ 0 (mod 25).…”
Section: Introductionmentioning
confidence: 99%
“…We set p(0) = 1 and p(n) = 0 if n < 0. For example, there are eight overpartitions of 3 3,3, 2 + 1,2 + 1, 2 +1,2 +1, 1 + 1 + 1,1 + 1 + 1.…”
Section: Introductionmentioning
confidence: 99%