Ramanujan-type Congruences for Overpartitions Modulo 5

preprint2014arXivOpen access

Abstract

Let p‾(n)\overline{p}(n) denote the number of overpartitions of nn. Hirschhorn and Sellers showed that p‾(4n+3)≡0(mod8)\overline{p}(4n+3)\equiv 0 \pmod{8} for n≥0n\geq 0. They also conjectured that p‾(40n+35)≡0(mod40)\overline{p}(40n+35)\equiv 0 \pmod{40} for n≥0n\geq 0. Chen and Xia proved this conjecture by using the (p,k)(p,k)-parametrization of theta functions given by Alaca, Alaca and Williams. In this paper, we show that p‾(5n)≡(−1)np‾(4⋅5n)(mod5)\overline{p}(5n)\equiv (-1)^{n}\overline{p}(4\cdot 5n) \pmod{5} for n≥0n \geq 0 and p‾(n)≡(−1)np‾(4n)(mod8)\overline{p}(n)\equiv (-1)^{n}\overline{p}(4n)\pmod{8} for n≥0n \geq 0 by using the relation of the generating function of p‾(5n)\overline{p}(5n) modulo 55 found by Treneer and the 22-adic expansion of the generating function of p‾(n)\overline{p}(n) due to Mahlburg. As a consequence, we deduce that p‾(4k(40n+35))≡0(mod40)\overline{p}(4^k(40n+35))\equiv 0 \pmod{40} for n,k≥0n,k\geq 0. Furthermore, applying the Hecke operator on ϕ(q)3ϕ(q)^3 and the fact that ϕ(q)3ϕ(q)^3 is a Hecke eigenform, we obtain an infinite family of congrences p‾(4k⋅5ℓ2n)≡0(mod5)\overline{p}(4^k \cdot5\ell^2n)\equiv 0 \pmod{5}, where k≥0k\ge 0 and ℓ\ell is a prime such that ℓ≡3(mod5)\ell\equiv3 \pmod{5} and (−nℓ)=−1\left(\frac{-n}{\ell}\right)=-1. Moreover, we show that p‾(52n)≡p‾(54n)(mod5)\overline{p}(5^{2}n)\equiv \overline{p}(5^{4}n) \pmod{5} for n≥0n \ge 0. So we are led to the congruences p‾(4k52i+3(5n±1))≡0(mod5)\overline{p}\big(4^k5^{2i+3}(5n\pm1)\big)\equiv 0 \pmod{5} for n,k,i≥0n, k, i\ge 0. In this way, we obtain various Ramanujan-type congruences for p‾(n)\overline{p}(n) modulo 55 such as p‾(45(3n+1))≡0(mod5)\overline{p}(45(3n+1))\equiv 0 \pmod{5} and p‾(125(5n±1))≡0(mod5)\overline{p}(125(5n\pm 1))\equiv 0 \pmod{5} for n≥0n\geq 0.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.