Abstract
In a recent work, Bringmann, Dousse, Lovejoy, and Mahlburg defined the function \(\overline{t}(n)\) to be the number of overpartitions of weight n where (i) the difference between two successive parts may be odd only if the larger part is overlined and (ii) if the smallest part is odd, then it is overlined. In their work, they proved that \(\overline{t}(n)\) satisfies an elegant congruence modulo 3, namely, for \(n\ge 1,\)
In this work, using elementary tools for manipulating generating functions, we prove that \(\overline{t}\) satisfies a corresponding parity result. We prove that, for all \(n\ge 1,\)
We also provide a truly elementary proof of the mod 3 characterization of Bringmann et al., as well as a number of additional congruences satisfied by \(\overline{t}(n)\) for various moduli.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
In a recent work, Bringmann et al. [2] defined the function \(\overline{t}(n)\) to be the number of overpartitions of weight n where (i) the difference between two successive parts may be odd only if the larger part is overlined and (ii) if the smallest part is odd, then it is overlined. For example, \(\overline{t}(4)= 8,\) where the overpartitions in question are given by the following:
By considering certain q-difference equations, the authors prove that the generating function for \(\overline{t}(n)\) is given by
where
They also proved that \(\overline{t}(n)\) satisfies an elegant congruence modulo 3.
Theorem 1.1
For all \(n\ge 1,\)
In this work, using elementary tools for manipulating generating functions, we prove that \(\overline{t}\) satisfies a corresponding parity result.
Theorem 1.2
For all \(n\ge 1,\)
We also provide a truly elementary proof of the mod 3 characterization provided by Bringmann et al., as well as proofs of a number of additional congruences satisfied by \(\overline{t}(n)\) for various moduli. We list these additional congruences here:
Theorem 1.3
For all \(n\ge 0,\)
Theorem 1.4
For all \(n\ge 0,\)
Theorem 1.5
For all \(n\ge 0,\)
2 Preliminary tools
In the work that follows, we will utilize the following functions.
The functions \(\varphi (q)\) and \(\psi (q)\) are classical theta functions of Ramanujan, while b(q) was introduced by Borwein, Borwein, and Garvan [1]; see [4, Chapter 22]. The functions \(\Pi (q)\) and \(\Omega (q)\) are featured in [4, Chapter 26]. The function X(q) was introduced by Chan [3]; see [4, Sect. 14.3].
We will also make use of various lemmas. First, we note the following 2-dissections:
Lemma 2.1
Proof
This follows directly from [4, (1.9.4)]. \(\square \)
Lemma 2.2
Proof
See [4, (30.10.1)]. \(\square \)
Lemma 2.3
Proof
See [4, (30.10.3)]. \(\square \)
Lemma 2.4
Proof
See [4, (30.12.1)]. \(\square \)
Lemma 2.5
Proof
See [4, (22.1.13)]. \(\square \)
Lemma 2.6
Proof
\(\square \)
Next, we call out three 3-dissections which we require.
Lemma 2.7
Proof
See [4, (14.3.3)]. \(\square \)
Lemma 2.8
Proof
See [4, (14.3.3)]. \(\square \)
Lemma 2.9
Proof
See [4, (14.3.1)]. \(\square \)
We also make use of the following congruences.
Lemma 2.10
Proof
Euler’s product [4, (1.6.1)] yields
\(\square \)
Lemma 2.11
Proof
Jacobi’s cube of Euler’s product [4, (1.7.1)] yields
\(\square \)
Lemma 2.12
Proof
\(\square \)
With the above tools in hand, we are prepared to prove all of the theorems mentioned above in elementary fashion.
3 Proofs of Theorems 1.1–1.5
We begin this section by providing a truly elementary proof of Theorem 1.1 which was originally proven in [2].
Proof of Theorem 1.1
We have
The result follows. \(\square \)
Remark 3.1
Theorem 1.1 provides an immediate proof of the modulo 3 “portion” of the congruences listed in Theorem 1.4. One simply needs to show that there are no squares in the arithmetic progressions in question; this requires a simple set of straightforward calculations. Hence, in what follows, we only focus on the modulo 4 portion of those congruences listed in Theorem 1.4.
We next turn to an elementary proof of Theorem 1.2 in the spirit of the proof of Theorem 1.1 just provided.
Proof of Theorem 1.2
We have
using Lemma 2.3. Therefore, modulo 2,
\(\square \)
We note, in passing, that the work above implies that
We will use this fact later in our proof of Theorem 1.5.
We now turn to the proofs of Theorems 1.3–1.4 which require a number of generating function dissections.
Proof of Theorems 1.3–1.4
We continue to compute a variety of generating function dissections.
So
Therefore,
and
It follows that, modulo 12,
Now,
This implies
Note also that, modulo 4,
Now, modulo 2,
It follows that, modulo 4,
If we extract the terms of the form \(q^{3n+2},\) we find that
For the remainder of this proof, unless explicitly stated otherwise, all congruences are computed modulo 4.
Next, we see that
From the above 2-dissection, we know
and
Note that
So
This means
and
This implies
Also,
This yields
and
In a different vein,
Hence,
Therefore,
and
Also from above, we know
Moreover,
which is an even function of q. Therefore, for all \(n\ge 0,\)
From a different perspective,
using Lemma 2.9. Thus,
Thanks to (11),
So
using Lemmas 2.7 and 2.8. This yields
Thanks to the above work on congruences modulo 4, as well as Remark 3.1 which provides us with the necessary congruences modulo 3, we see that the proofs of Theorems 1.3 and 1.4 are now complete. \(\square \)
We now provide a proof of Theorem 1.5 by appropriately dissecting the generating function for \(\overline{t}(2n+1)\) which was obtained earlier.
Proof of Theorem 1.5
Thanks to (10) above,
So
Thus,
This implies that, for all \(n\ge 0,\)
\(\square \)
4 Closing thoughts
Computational evidence indicates that additional congruences are satisfied by \(\overline{t}\) for various moduli. Proofs of such congruences are left to the interested reader.
References
Borwein, J.M., Borwein, P.B., Garvan, F.G.: Some cubic modular identities of Ramanujan. Trans. Am. Math. Soc. 343(1), 35–47 (1994)
Bringmann, K., Dousse, J., Lovejoy, J., Mahlburg, K.: Overpartitions with restricted odd differences. Electron. J. Comb. 22(3), 3.17 (2015)
Chan, H.-C.: Ramanujan’s cubic continued fraction and an analog of his “most beautiful identity,”. Int. J. Number Theory 6(3), 673–680 (2010)
Hirschhorn, M.D.: The Power of \(q,\) Developments in Mathematics, vol. 49. Springer, Berlin (2017)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Hirschhorn, M.D., Sellers, J.A. Congruences for overpartitions with restricted odd differences. Ramanujan J 53, 167–180 (2020). https://doi.org/10.1007/s11139-019-00156-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11139-019-00156-x