Some congruences modulo 5 and 25 for overpartition
Shane Chern, Manosij Ghosh Dastidar

TL;DR
This paper discovers new Ramanujan-type congruences modulo 5 and 25 for overpartition functions, confirming a conjecture and expanding understanding of overpartition congruences.
Contribution
It introduces two new congruences modulo 5 and proves four conjectured congruences modulo 25 for overpartitions, advancing the theory of partition congruences.
Findings
Two new Ramanujan-type congruences modulo 5 for overpartition
Four congruences modulo 25 confirmed for overpartition
Affirmative answer to Dou and Lin's conjecture
Abstract
We present two new Ramanujan-type congruences modulo 5 for overpartition. We also give an affirmative answer to a conjecture of Dou and Lin, which includes four congruences modulo 25 for overpartition.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Identities · Analytic Number Theory Research · Advanced Combinatorial Mathematics
Some congruences modulo and for overpartition
Shane Chern
Department of Mathematics, Pennsylvania State University, University Park, PA 16802, USA
[email protected]; [email protected]
and
Manosij Ghosh Dastidar
Department of Mathematical Sciences, Pondicherry University, R. V. Nagar, Kalapet, Puducherry, PIN-605014, India
Abstract.
We present two new Ramanujan-type congruences modulo for overpartition. We also give an affirmative answer to a conjecture of Dou and Lin, which includes four congruences modulo for overpartition.
Keywords. Overpartition, Ramanujan-type congruence.
2010MSC. Primary 11P83; Secondary 05A17.
1. Introduction
An overpartition of a positive integer is a partition of where the first occurrence of each distinct part may be overlined. For example, has the following eight overpartitions:
[TABLE]
As usual, we use to denote the number of overpartitions of . We also agree that . It is well known that the generating function of is
[TABLE]
where we adopt the standard notation
[TABLE]
For convenience, when is a positive integer, we write
[TABLE]
Similar to the standard partition function , many authors also found various Ramanujan-type identities and congruences for . The interested readers may refer to [4, 7, 8, 9, 11]. Recently, Dou and Lin [5] presented the following four congruences for :
[TABLE]
where , , , and . In a subsequent paper, Hirschhorn [6] obtained simple proofs of Dou and Lin’s congruences.
The main purpose of this paper is to give an elementary proof to a conjecture of Dou and Lin [5].
Theorem 1.1**.**
For ,
[TABLE]
Furthermore, using a powerful method involving modular forms due to Radu and Sellers [10], we also obtain two new congruences modulo for .
Theorem 1.2**.**
For ,
[TABLE]
where and .
2. Proof of Theorem 1.1
2.1. Preliminaries
We first introduce some notations of Ramanujan’s theta functions. Let
[TABLE]
We can write , , , and in terms of some ’s defined in the previous section:
[TABLE]
We also write
[TABLE]
At first, we notice that from the binomial theorem,
[TABLE]
holds for any positive integer . The following results also play an important role in our proof of Theorem 1.1.
Lemma 2.1**.**
[TABLE]
Proof.
Ramanujan [3, p. 365, Eq. (18.1)] asserted that
[TABLE]
that is,
[TABLE]
Hence we have
[TABLE]
∎
Lemma 2.2**.**
[TABLE]
Proof.
Ramanujan [2, p. 258, Entry 9(iii)] also asserted that
[TABLE]
that is,
[TABLE]
Hence we have
[TABLE]
∎
Let
[TABLE]
and
[TABLE]
The following relations are due to Alaca and Williams [1].
Lemma 2.3**.**
[TABLE]
[TABLE]
and
[TABLE]
2.2. Proof of Eqs. (1.1) and (1.4)
We need the following interesting identity.
Lemma 2.4**.**
[TABLE]
Proof.
Note that
[TABLE]
Hence it suffices to show
[TABLE]
Thanks to Lemmas 2.1 and 2.2, we can rewrite it as
[TABLE]
or equivalently,
[TABLE]
since the constant term in the series of is , and hence is invertible in the ring . According to Lemma 2.3, it becoms
[TABLE]
where
[TABLE]
Hence the identity follows obviously. ∎
Now from [6, Eq. (3.4)], we deduce that
[TABLE]
Note that
[TABLE]
has no terms of the form and , while is a series of . Hence
[TABLE]
and
[TABLE]
2.3. Proof of Eqs. (1.2) and (1.3)
This time we need
Lemma 2.5**.**
[TABLE]
Proof.
Note that
[TABLE]
It therefore suffices to show
[TABLE]
Again by Lemmas 2.1 and 2.2, we can rewrite it as
[TABLE]
or equivalently,
[TABLE]
According to Lemma 2.3, it becoms
[TABLE]
where
[TABLE]
The lemma follows immediately. ∎
Similarly we see from [6, Eq. (3.3)] that
[TABLE]
Through a similar argument, we conclude that
[TABLE]
and
[TABLE]
3. Proof of Theorem 1.2
3.1. The method of Radu and Sellers
Let . For a positive integer , we define
[TABLE]
and
[TABLE]
Let be a positive integer. We denote by the set of integer sequences indexed by the positive divisors of . For a positive integer , we set . We also denote by the set of all invertible elements in , and by the set of all squares in . For , we set
[TABLE]
[TABLE]
and
[TABLE]
where , , , and .
Finally let
[TABLE]
for some . Radu and Sellers’ result states as
Lemma 3.1**.**
Let be a positive integer, , the set of tuples satisfying conditions given in [10, p. 2255], , be the number of double cosets in , and be a complete set of representatives of the double coset . Assume that for all . Let and
[TABLE]
Then if
[TABLE]
for all , then
[TABLE]
for all .
3.2. Proof of Theorem 1.2
To apply the method of Radu and Sellers, we notice that
[TABLE]
Then we may take
[TABLE]
By the definition of , we have
[TABLE]
Now we can choose
[TABLE]
Let
[TABLE]
It follows by [10, Lemma 2.6] that contains a complete set of representatives of the double coset . One may verify that all assumptions of Lemma 3.1 are satisfied. Hence we obtain the upper bound . Theorem 1.2 follows immediately by checking the two congruences for from [math] to .
3.3. Remarks
We remark that this method can also be applied to prove Theorem 1.1. At first, note that
[TABLE]
Now for and , we choose
[TABLE]
and compute . Then we set
[TABLE]
and therefore obtain the upper bound .
Similarly, for and , we have
[TABLE]
[TABLE]
and thus the upper bound .
Finally, we see that Theorem 1.1 follows directly from a simple verification.
Acknowledgements
We thank George E. Andrews and Yucheng Liu for some helpful discussions.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Ş. Alaca and K. S. Williams, The number of representations of a positive integer by certain octonary quadratic forms, Funct. Approx. Comment. Math. 43 (2010), part 1, 45–54.
- 2[2] B. C. Berndt, Ramanujan’s notebooks. Part III , Springer-Verlag, New York, 1991. xiv+510 pp.
- 3[3] B. C. Berndt, Ramanujan’s notebooks. Part V , Springer-Verlag, New York, 1998. xiv+624 pp.
- 4[4] W. Y. C. Chen, L. H. Sun, R. H. Wang, and L. Zhang, Ramanujan-type congruences for overpartitions modulo 5 5 5 , J. Number Theory 148 (2015), 62–72.
- 5[5] D. Q. J. Dou and B. L. S. Lin, New Ramanujan type congruences modulo 5 5 5 for overpartitions, Ramanujan J. , in press.
- 6[6] M. D. Hirschhorn, Some congruences for overpartitions, New Zealand J. Math. 46 (2016), 141–144.
- 7[7] M. D. Hirschhorn and J. A. Sellers, An infinite family of overpartition congruences modulo 12 12 12 , Integers 5 (2005), no. 1, A 20, 4 pp.
- 8[8] B. Kim, The overpartition function modulo 128 128 128 , Integers 8 (2008), A 38, 8 pp.
