Document Type
Article
Abstract
Let p be prime, and let p[1,p](n) denote the function whose generating function is
∏ n≥1 (1 − qn)−1 (1 − qpn)−1.
This function and its generalizations p[cr,dm](n) are the subject of study in several recent papers. Let ℓ ≥ 5, let j ≥ 1, and let p ∈ {2, 3, 5}. In this paper, we prove that the generating function for p[1,p](n) in the progression βp,ℓ,j modulo ℓj with 24βp,ℓ,j ≡ p + 1 (mod ℓj) lies in a Hecke-invariant subspace of type
{ η(Dz)r η(Dpz)s F(Dz) : F(z) ∈ Ms(Γ0(p), χ) }.
for suitable D ≥ 1, s ≥ 0, and character χ. When p ∈ {2, 3, 5}, we use the Hecke-invariance of these subspaces proved in [21] to prove, for distinct primes ℓ and m ≥ 5 and j ≥ 1, congruences of the form
p[1,p] ( (ℓjmkn + 1) / D ) ≡ 0 (mod ℓj).
for all n ≥ 1 with m ∤ n, where k is explicitly computable and depends on the forms in the invariant subspace. Our proofs require adapting and extending analogous level one results on p(n) in [1] and [22] to level p.
Digital Object Identifier (DOI)
Publication Info
Published in Research in Number Theory, Volume 12, 2026.
APA Citation
Boylan, M., & Swati. (2026). Congruence properties modulo prime powers for a class of partition functions. Research in Number Theory, 12.https://doi.org/10.1007/s40993-026-00715-4
Rights
This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.