Abstract
In 2007, Andrews and Paule introduced the family of functions which enumerate the number of broken k-diamond partitions for a fixed positive integer k. Since then, numerous mathematicians have considered partitions congruences satisfied by for small values of k. In this work, we provide an extensive analysis of the parity of the function , including a number of Ramanujan-like congruences modulo 2. This will be accomplished by completely characterizing the values of modulo 2 for and any value of . In contrast, we conjecture that, for any integers , and is infinitely often even and infinitely often odd. In this sense, we generalize Subbaraoʼs Conjecture for this function . To the best of our knowledge, this is the first generalization of Subbaraoʼs Conjecture in the literature.
MSC: primary, 11P83; secondary, 05A17
Keywords: Broken k-diamonds, Congruences, Modular forms, Partitions
1. Introduction
Broken k-diamond partitions were introduced in 2007 by Andrews and Paule [2]. These are constructed in such a way that the generating functions of their counting sequences are closely related to modular forms. Namely,
where we recall the Dedekind eta function
In their original work, Andrews and Paule proved that, for all ,
| (1.1) |
They also conjectured a few other congruences modulo 2 satisfied by certain families of broken k-diamond partitions.
Since then, a number of authors have provided proofs of additional congruences satisfied by broken k-diamond partitions. Hirschhorn and Sellers [5] provided a new proof of (1.1) above as well as elementary proofs of the following parity results: For all ,
The third result in the list above appeared in [2] as a conjecture while the other three did not. Soon after the publication of [5], Chan [3] provided a different proof of the parity results for mentioned above as well as a number of congruences modulo powers of 5. Subsequently, Paule and Radu [7] also proved a number of congruences modulo 5 for broken 2-diamond partitions, and they also shared conjectures related to broken 3-diamond partitions modulo 7 and broken 5-diamond partitions modulo 11. (Two of these conjectures have recently been proven by Xiong [12].)
Our goal in this work is to focus on parity results satisfied by . The parity of this function has been studied, at least partially, by Radu and Sellers [10] who proved (among other things) that, for all ,
| (1.2) |
We wish to greatly extend results such as those mentioned in (1.2). This will be accomplished by completely characterizing the values of modulo 2 for and any value of by finding interesting relationships modulo 2 between the generating functions for for these special values of r and classical q-series. We also note here that, while is extremely “well-behaved” modulo 2 for the values , and satisfies numerous congruences modulo 2 in arithmetic progressions, we also believe that does not satisfy any Ramanujan-like congruences modulo 2 within any subprogression of 8n or . In this sense, we generalize Subbaraoʼs Conjecture for this function by calling attention to the two arithmetic progressions 8n and . Our hope is that such an analysis will motivate others to complete similar work on other restricted partition functions ; namely, to locate a particular value A such that has very nice parity properties for certain values of r while having no congruences modulo 2 within the other arithmetic progressions of the form . (This seems to be a natural next step in the study of the parity of partition functions given the first authorʼs recent proof of Subbaraoʼs Conjecture [9].)
We note, in passing, that we also prove a number of parity results for and for various values of r. We begin with a characterization of the parity of for any n.
Theorem 1.1
(1.3)
Remark 1.2
It should be noted that the coefficients of the power series representation of the product on the right-hand side of (1.3) can be completely classified modulo 2. First, we note that
We then define
Next note that unless . If we observe that
Moreover, if , then . This is clear because if then which implies that which implies that . Thus every solution to can be transformed into a solution of where and and vice versa. Next, let n be a positive integer with and let α be an integer greater than 2. Assume that there exists with such that
We note that the ring is a unique factorization domain. In particular, we have
Assume that
where are primes. Set
Note that
If is maximal such that , then which implies that for . It follows that
for some and . Furthermore, either
or
divides . These are the only possibilities that guarantee that x and y are odd. Consequently, in total we have possibilities for . If out of this we choose only those with we obtain possibilities. This implies that
where and
Thus,
iff is even for all j or equivalently if n is a square. Next note that iff and is even and nonnegative. This implies that
where
Thus
Hence,
Thanks to the above analysis, we have the following:
Corollary 1.3
For all,if and only ifor.
Notice that the three congruences mentioned in (1.2) follow almost immediately from this characterization given in Corollary 1.3. For example, the above work implies that we need to consider whether or can be represented as or for some integer t in order to determine the parity of . Note that is not divisible by 7, so it cannot be written in the form . Moreover, can never be square because and 3 is a quadratic nonresidue modulo 7. In analogous fashion, because 6 is a quadratic nonresidue modulo 7, and because 5 is a quadratic nonresidue modulo 7.
We now consider parity results satisfied by for various values of r.
Theorem 1.4
Theorem 1.5
Theorem 1.6
Remark 1.7
A few remarks are in order regarding Theorem 1.6. First, note that the product on the right-hand side of the congruence is an even function of q. This implies that, for all , or . Secondly, note that the right-hand side of Theorem 1.6 is the same as the right-hand side in Theorem 1.1 except with q replaced by . Therefore, we can completely characterize the values of modulo 2 via the remarks made regarding Theorem 1.1.
Our last set of theorems provides information about the parity of for a number of values of r.
Theorem 1.8
Remark 1.9
As with Theorem 1.6, it is clear that the right-hand side in Theorem 1.8 is an even function of q. Thus, we know that, for all , immediately. But we actually can say more. Thanks to Eulerʼs Pentagonal Number Theorem [1, Corollary 1.7], we know
Therefore, we can explicitly state when is even or odd; namely, for any , is odd if and only if for some integer m. This is equivalent to saying is odd if and only if is a perfect square. This means we can write down numerous Ramanujan-like congruences modulo 2 within the arithmetic progression with ease.
Theorem 1.10
Theorem 1.11
Remark 1.12
Given Theorem 1.1, we see that Theorem 1.11 clearly implies that, for all , , an attractive “internal” congruence satisfied by . We will briefly mention this congruence again in our concluding remarks below.
Theorem 1.13
A remark is in order regarding Theorem 1.10, Theorem 1.13. We have
Consequently,
and
Next we note that
and
For given x with the set of solutions such that can be partitioned into equivalence classes and two solutions and are equivalent iff and . In particular each equivalence class has exactly 4 elements and there is only one solution in each class such that and . This implies in particular that for
| (1.4) |
we have
This implies that
In a similar fashion we conclude that
Because of these two relations we observe that in order to understand and modulo 2 we need to understand in (1.4) for n odd. By [4, p. 61, Lemma 3.25] we know that, for and odd with ,
Let with squarefree. Then we observe immediately that
Consequently,
| (1.5) |
By using the fact that
one can lift the restriction that . From (1.5) we observe that is multiplicative for odd m. Because of (1.5), we know for prime that
This now leads to two corollaries which give a characterization of the values of and , modulo 2, in terms of this function just described:
Corollary 1.14
For all , .
Corollary 1.15
For all , .
Theorem 1.16
Remark 1.17
As was discussed after Theorem 1.8, we can employ Eulerʼs Pentagonal Number Theorem here as well to obtain a similar classification result. We can also easily see that, for all , since the right-hand side of Theorem 1.16 is an even function of q. In similar fashion, since the right-hand side is also a function of , we can say that, for all , for .
2. Proof of the congruences
Let
and
Then
Let
For χ a character we define
and for , let
Define the -operator by
We need that for , and χ a character modulo N we have
| (2.1) |
and
| (2.2) |
One verifies that our congruences are equivalent to the following:
| (2.3) |
Next note that ϕ is a series in powers of . Let . In particular note that is a series in powers of . Using (2.1) and (2.2) we find
| (2.4) |
Recall that . Then because of (2.4), (2.3) is equivalent to:
| (2.5) |
Denote by the set of weak modular forms of weight k and character χ for the group . By [6, Thm. 1.64] we have that and . Furthermore, by [6, Prop. 2.8] we have that if and is a character modulo m, then . By [6, Prop. 2.22], if and , then . This implies that the left-hand side of the relations in (2.5) in the first three lines are in , in the next four lines they are in and in the last two lines they are in . One can check the same holds for the functions on the right-hand side using [6, Thm. 1.64]. Using a generalization of Sturmʼs theorem [11], namely [6, Thm. 2.58], we find that the first three identities hold if they hold for the first coefficients in their q-expansion. Similarly, the next four identities hold if they hold for coefficients in their q-expansions. Finally for the last two identities on needs to check about 215 040 coefficients modulo 2.
Remark 2.1
An alternative method to prove these identities in their original form is using the approach from [8] which leads to a less elegant proof but more direct on the problem. We calculated using this method that we do not need to compute more than 1056 coefficients for any of the identities.
3. Closing comments
We close this note by sharing a conjectured infinite family of “internal” congruences satisfied by modulo powers of 2:
Conjecture
Let
Then, for all and ,
and
The case of this conjecture was proven above; namely, in Remark 1.12, we noted that
for all .
Acknowledgments
The authors thank Heinrich Rolletschek for helpful discussions related to algebraic number theory. The authors also gratefully acknowledge the referee for insightful comments related to the proof techniques found in this paper.
Communicated by David Goss
Footnotes
This is an open-access article distributed under the terms of the Creative Commons Attribution-NonCommercial-No Derivative Works License, which permits non-commercial use, distribution, and reproduction in any medium, provided the original author and source are credited.
Contributor Information
Silviu Radu, Email: sradu@risc.uni-linz.ac.at.
James A. Sellers, Email: sellersj@psu.edu.
References
- 1.Andrews G.E. Addison–Wesley; 1976. The Theory of Partitions. [Google Scholar]
- 2.Andrews G.E., Paule P. MacMahonʼs partition analysis XI: Broken diamonds and modular forms. Acta Arith. 2007;126:281–294. [Google Scholar]
- 3.Chan S.H. Some congruences for Andrews–Pauleʼs broken 2-diamond partitions. Discrete Math. 2008;308:5735–5741. [Google Scholar]
- 4.Cox D.A. John Wiley and Sons; 1989. Primes of the Form : Fermat, Class Field Theory, and Complex Multiplication. [Google Scholar]
- 5.Hirschhorn M.D., Sellers J.A. On recent congruence results of Andrews and Paule. Bull. Aust. Math. Soc. 2007;75:121–126. [Google Scholar]
- 6.K. Ono, The Web of Modularity: Arithmetic of the Coefficients of Modular Forms and q-Series, CBMS Regional Conference Series in Mathematics, vol. 102, Washington, DC, 2004, published for the Conference Board of the Mathematical Sciences.
- 7.Paule P., Radu S. Infinite families of strange partition congruences for broken 2-diamonds. Ramanujan J. 2010;23(1–3):409–416. [Google Scholar]
- 8.Radu S. An algorithmic approach to Ramanujanʼs congruences. Ramanujan J. 2009;20(2):215–251. [Google Scholar]
- 9.Radu S. A proof of Subbaraoʼs conjecture. J. Reine Angew. Math. 2012;672:161–175. [Google Scholar]
- 10.Radu S., Sellers J.A. Parity results for broken k-diamond partitions and -cores. Acta Arith. 2011;146:43–52. [Google Scholar]
- 11.Sturm J. vol. 1240. Springer; Berlin, Heidelberg: 1987. On the Congruence of Modular Forms; pp. 275–280. (Lecture Notes in Math.). [Google Scholar]
- 12.Xiong X. Two congruences involving Andrews–Pauleʼs broken 3-diamond partitions and 5-diamond partitions. Proc. Japan Acad. Ser. A Math. Sci. 2011;87(5):65–68. [Google Scholar]
