Abstract
The notion of broken k-diamond partitions was introduced by Andrews and Paule. Let \(\Delta _k(n)\) denote the number of broken k-diamond partitions of n for a fixed positive integer k. Recently, a number of parity results satisfied by \(\Delta _k(n)\) for small values of k have been proved by Radu and Sellers and others. However, congruences modulo 4 for \(\Delta _k(n)\) are unknown. In this paper, we will prove five congruences modulo 4 for \(\Delta _5(n)\), four infinite families of congruences modulo 4 for \(\Delta _7(n)\) and one congruence modulo 4 for \(\Delta _{11}(n)\) by employing theta function identities. Furthermore, we will prove a new parity result for \(\Delta _2(n)\).
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
The aim of this paper is to establish congruences modulo 4 for broken 5-diamond, broken 7-diamond and broken 11-diamond partitions.
Let us begin with some notation and terminology on q-series and partitions. We use the standard notation
and often write
Recall that the Ramanujan theta function f(a, b) is defined by
Jacobi’s triple product identity states that
Three special cases of (1.1) are defined by
and
For any positive integer n, we use \(f_n\) to denote \(f(-q^n)\), that is,
MacMahon’s partition analysis guided Andrews and Paule [2] to introduce broken k-diamond partitions. For a fixed positive integer k, let \(\Delta _k(n)\) denote the number of broken k-diamond partitions of n. Andrews and Paule [2] discovered the following generating function for \(\Delta _k(n)\):
Various authors have obtained parity results for broken k-diamond partitions. See, Ahmed and Baruah [1], Chan [5], Cui and Gu [6], Hirschhorn and Sellers [8], Lin [10], Radu and Sellers [11, 12], Wang [14], Xia [15] and Yao [18].
However, Ramanujan-type congruences modulo 4 for \(\Delta _k(n)\) are unknown. With this motivation, we will prove five congruences modulo 4 for \(\Delta _5(n)\), four infinite families of congruences modulo 4 for \(\Delta _7(n)\) and one congruence modulo 4 for \(\Delta _{11}(n)\). The main results of this paper can be stated as follows.
Theorem 1.1
For \(n\ge 0\),
where \(j\in \{2,\ 14,\ 30,\ 34,\ 38\}\).
Theorem 1.2
For \(n,\ \alpha \ge 0\),
Theorem 1.3
For \(n,\alpha \ge 0\),
By Theorem 1.3 and the facts that \(\Delta _{11}(5)\equiv \Delta _{11}(3) \ (\mathrm{mod\ 4})\), \(\Delta _{11}(9)-\Delta _{11}(5) \equiv -1\ (\mathrm{mod\ 4})\), \(\Delta _{11}(13)-\Delta _{11}(7) \equiv 2\ (\mathrm{mod\ 4})\) and \(\Delta _{11}(65)-\Delta _{11}(33) \equiv 1\ (\mathrm{mod\ 4})\), we obtain the following corollary:
Corollary 1.4
For \(\alpha \ge 0\),
Moreover, we will prove the following congruence modulo 2 for \(\Delta _2(n)\) in Sect. 5.
Theorem 1.5
For \(n\ge 0\),
2 Proof of Theorem 1.1
In order to prove Theorem 1.1, we first prove three lemmas.
Lemma 2.1
We have
Proof
From (36.8) in Berndt’s book [3, p. 69], we see that if \(\mu \) is even, then
Setting \(\mu =6\) and \(\nu =5\) in (2.2), we get
By (1.2),
and
Substituting (1.6), (2.4)–(2.7) into (2.3), we arrive at (2.1). This completes the proof. \(\square \)
Lemma 2.2
Define
Then for \(n\ge 0\),
where \(i\in \{2,\ 6,\ 7,\ 8,\ 10\}\).
Proof
It is well known that
Thus, combining (2.8) and the above identity yields
It is easy to check that for any integer n,
and
Congruence (2.9) follows from (2.10), (2.11) and (2.12). The proof is complete. \(\square \)
Lemma 2.3
Define
Then for \(n\ge 0\),
where \(k\in \{2,\ 3,\ 4,\ 6,\ 9\}\).
Proof
Hirschhorn and Sellers [9] proved that if
is the prime factorization of \(3n + 1\), then
where b(n) is defined by (2.13). By (2.15) and (2.16), we find that for \(n\ge 0\), b(n) is odd if and only if \(3n + 1\) is a square of an integer. From (2.11), we know that \(33n + 7\), \(33n + 10\), \(33n + 13\), \(33n + 19\) and \(33n + 28\) are not squares, which implies that for \(n\ge 0\),
where \(k\in \{2,\ 3,\ 4,\ 6,\ 9\}\). This completes the proof. \(\square \)
Now, we turn to prove Theorem 1.1.
Setting \(k=5\) in (1.7), we have
By the binomial theorem, for positive integers u and v,
and
In particular,
and
Replacing q by \(-q\) in (2.1) and using the fact that
then multiplying \(\frac{1}{f_4f_{44}}\) on both sides, we obtain
Combining (2.22) and (2.24) yields
The following relation is a consequence of dissection formulas of Ramanujan collected in Entry 25 in Berndt’s book [3, p. 40]:
Xia and Yao [16] proved that
By substituting (2.26) and (2.27) into (2.25),
which yields
Therefore, we can rewrite (2.29) as
where a(n) and b(n) are defined by (2.8) and (2.13), respectively. Theorem 1.1 follows from (2.9), (2.14) and (2.30). This completes the proof. \(\square \)
3 Proof of Theorem 1.2
In this section, we present a proof of Theorem 1.2.
Taking \(k=7\) in (1.7), we get
Replacing q by \(-q\) in (3.2) and utilizing the relation (2.23), we get
where \(\psi (q)\) is defined by (1.6). From Entry 9 in Berndt’s book [3, p. 377],
which yields
From Entry 9 in Berndt’s book [3, p. 377],
Combining (3.5) and (3.6), we deduce that
which implies
In view of (1.6), (2.21) and (3.7),
Ramanujan [13] stated the following identity without proof:
where
Hirschhorn [7] gave a simple proof of (3.9) by using Jacobi’s triple product identity. Substituting (3.9) into (3.8), we have
which yields
and
where R(q) is defined by (3.10). We can rewrite (3.13) as
Xia and Yao [17] proved that
Thanks to (2.20), (2.21) and (3.16),
Substituting (3.17) into (3.15), we get
which yields
By (2.18), (2.20) and (3.18), we obtain
which implies that for \(n\ge 0\),
Similarly, by (2.19), (2.21), (3.10) and (3.11),
By substituting (3.17) into (3.20) and extracting the terms containing odd powers of q,
In view of (2.18), (2.20) and (3.21),
which implies that for \(n\ge 0\),
Substituting (3.9) into (3.12), we obtain
which yields
and
By (2.19), (2.21), (3.10) and (3.23),
By substituting (3.17) into (3.26) and extracting the terms containing odd powers of q,
Thanks to (2.18), (2.20) and (3.27),
which implies that for \(n\ge 0\),
It follows from (3.8) and (3.24) that for \(n\ge 0\),
By (3.29) and mathematical induction, we deduce that for \(n\ge 0\) and \(\alpha \ge 0\),
By (2.19), (2.21), (3.10) and (3.25),
By substituting (3.17) into (3.31) and extracting the terms containing odd powers of q,
Based on (2.18), (2.20) and (3.32),
which implies that for \(n\ge 0\),
Replacing n by 20n in (3.30) and using (3.19), we get (1.9). Replacing n by \(20n+16\) in (3.30) and using (3.22), we obtain (1.10). Replacing n by \(100n+38\) in (3.30) and using (3.33), we arrive at (1.11). Replacing n by \(100n+78\) in (3.30) and using (3.28), we deduce (1.12). The proof of Theorem 1.2 is complete. \(\square \)
4 Proof of Theorem 1.3
Setting \(k=11\) in (1.7) and employing (2.21), we have
Replacing q by \(-q\) in (4.1) and using (2.23) yields
Chan and Toh [4] proved that
Multiplying \(-\frac{f_2^2f_{46}^2}{f_4f_{92}}\) on both sides of (4.3) yields
Combining (4.1), (4.2) and (4.4) yields
Therefore,
Replacing q by \(-q\) in (4.5) and using (2.23) yields
In view of (4.4), (4.5) and (4.6),
which yields
From Berndt’s book [3, Entry 31, p. 48],
where \(U_n=a^{\frac{(n+1)n}{2}}b^{\frac{n(n-1)}{2}}\) and \(V_n=a^{\frac{(n-1)n}{2}}b^{\frac{n(n+1)}{2}}\). Taking \(n=23\), \(U_1=a=-q\) and \(V_1=b=-q^{2}\) in (4.9), we have
Substituting (4.10) into (4.8), extracting the terms of the form \(q^{23n}\) in both sides and then replacing \(q^{23}\) by q, we deduce that
It follows from (4.8) and (4.11) that for \(n\ge 0\),
Congruence (1.13) follows from (4.12) and mathematical induction. This completes the proof of Theorem 1.3.
5 Proof of Theorem 1.5
In this section, we prove Theorem 1.5.
By setting \(k=2\) in (1.7),
Xia and Yao [17] proved that
By substituting (5.4) into (5.2),
which yields
and
Substituting (3.9) into (5.5), we obtain
which yields
Congruence (1.14) follows from (5.6) and (5.7). This completes the proof of Theorem 1.5. \(\square \)
References
Ahmed, Z., Baruah, N.D.: Parity results for broken 5-diamond, 7-diamond and 11-diamond partitions. Int. J. Number Theory 11, 527–542 (2015)
Andrews, G.E., Paule, P.: MacMahon’s partition analysis XI: broken diamonds and modular forms. Acta Arith. 126, 281–294 (2007)
Berndt, B.C.: Ramanujan’s Notebooks. Part III. Springer, New York (1991)
Chan, H.H., Toh, P.C.: New analogues of Ramanujan’s partition identities. J. Number Theory 130, 1898–1913 (2010)
Chan, S.H.: Some congruences for Andrews–Paule’s broken \(2\)-diamond partitions. Discret. Math. 308, 5735–5741 (2008)
Cui, S.P., Gu, N.S.S.: Congruences for broken 3-diamond and 7 dots bracelet partitions. Ramanujan J. 35, 165–178 (2014)
Hirschhorn, M.D.: Ramanujan’s “most beautiful identity”. Am. Math. Monthly 118, 839–845 (2011)
Hirschhorn, M.D., Sellers, J.A.: On recent congruence results of Andrews and Paule. Bull. Aust. Math. Soc. 75, 121–126 (2007)
Hirschhorn, M.D., Sellers, J.A.: Elementary proofs of various facts about 3-cores. Bull. Aust. Math. Soc. 79, 507–512 (2009)
Lin, B.L.S.: Elementary proofs of parity results for broken 3-diamond partitions. J. Number Theory 135, 1–7 (2014)
Radu, S., Sellers, J.A.: Parity results for broken \(k\)-diamond partitions and \((2k+1)\)-cores. Acta Arith. 146, 43–52 (2011)
Radu, S., Sellers, J.A.: An extensive analysis of the parity of broken \(3\)-diamond partitions. J. Number Theory 133, 3703–3716 (2013)
Ramanujan, S.: Collected Papers. In: Hardy, G.H., Seshu Aiyar, P.V., Wilson, B.M. (eds.) AMS Chelsea, Providence, RI (2000)
Wang, Y.D.: More parity results for broken 8-diamond partitions. Ramanujan J. 39, 339–346 (2016)
Xia, E.X.W.: New congruences modulo powers of 2 for broken 3-diamond partitions and 7-core partitions. J. Number Theory 141, 119–135 (2014)
Xia, E.X.W., Yao, O.X.M.: New Ramanujan-like congruences modulo powers of 2 and 3 for overpartitions. J. Number Theory 133, 1932–1949 (2013)
Xia, E.X.W., Yao, O.X.M.: Analogues of Ramanujan’s partition identities. Ramanujan J. 31, 373–396 (2013)
Yao, O.X.M.: New parity results for broken 11-diamond partitions. J. Number Theory 140, 267–276 (2014)
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by the National Science Foundation of China (grant no. 11401260 and 11571143), and Jiangsu University Training Program for Prominent Young Teachers.
Rights and permissions
About this article
Cite this article
Xia, E.X.W. Congruences modulo 4 for broken k-diamond partitions. Ramanujan J 45, 331–348 (2018). https://doi.org/10.1007/s11139-016-9858-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11139-016-9858-1