Skip to main content
Elsevier Sponsored Documents logoLink to Elsevier Sponsored Documents
. 2013 Nov;133(11):3703–3716. doi: 10.1016/j.jnt.2013.05.009

An extensive analysis of the parity of broken 3-diamond partitions

Silviu Radu a,1, James A Sellers b,⁎,2
PMCID: PMC4707141  PMID: 26869731

Abstract

In 2007, Andrews and Paule introduced the family of functions Δk(n) 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 Δk(n) for small values of k. In this work, we provide an extensive analysis of the parity of the function Δ3(n), including a number of Ramanujan-like congruences modulo 2. This will be accomplished by completely characterizing the values of Δ3(8n+r) modulo 2 for r{1,2,3,4,5,7} and any value of n0. In contrast, we conjecture that, for any integers 0B<A, Δ3(8(An+B)) and Δ3(8(An+B)+6) is infinitely often even and infinitely often odd. In this sense, we generalize Subbaraoʼs Conjecture for this function Δ3. 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 (Δk(n))n0 are closely related to modular forms. Namely,

n=0Δk(n)qn=n=1(1q2n)(1q(2k+1)n)(1qn)3(1q(4k+2)n)=q(k+1)/12η(2τ)η((2k+1)τ)η(τ)3η((4k+2)τ),k1,

where we recall the Dedekind eta function

η(τ):=q124n=1(1qn)(q=e2πiτ).

In their original work, Andrews and Paule proved that, for all n0,

Δ1(2n+1)0(mod3). (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 n0,

Δ1(4n+2)0(mod 2),
Δ1(4n+3)0(mod 2),
Δ2(10n+2)0(mod 2),andΔ2(10n+6)0(mod 2)

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 Δ2 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 Δ3(n). The parity of this function has been studied, at least partially, by Radu and Sellers [10] who proved (among other things) that, for all n0,

Δ3(14n+7)0(mod 2),Δ3(14n+9)0(mod 2),andΔ3(14n+13)0(mod 2). (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 Δ3(8n+r) modulo 2 for r{1,2,3,4,5,7} and any value of n0 by finding interesting relationships modulo 2 between the generating functions for Δ3(8n+r) for these special values of r and classical q-series. We also note here that, while Δ3(8n+r) is extremely “well-behaved” modulo 2 for the values r{1,2,3,4,5,7}, and satisfies numerous congruences modulo 2 in arithmetic progressions, we also believe that Δ3 does not satisfy any Ramanujan-like congruences modulo 2 within any subprogression of 8n or 8n+6. In this sense, we generalize Subbaraoʼs Conjecture for this function Δ3 by calling attention to the two arithmetic progressions 8n and 8n+6. Our hope is that such an analysis will motivate others to complete similar work on other restricted partition functions f(n); namely, to locate a particular value A such that f(An+r) has very nice parity properties for certain values of r while having no congruences modulo 2 within the other arithmetic progressions of the form An+r. (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 Δ3(4n+r) and Δ3(2n+r) for various values of r. We begin with a characterization of the parity of Δ3(2n+1) for any n.

Theorem 1.1

n=0Δ3(2n+1)qnn=1(1qn)(1q7n)(mod 2). (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

q1/3n=1(1qn)(1q7n)m,nZq(6m1)2+7(6n1)224(mod 2).

We then define

n=0a(n)qn:=m,nZq(6m1)2+7(6n1)2(mod 2).

Next note that a(ν)=0 unless ν=24k+8. If ν=24k+8=8(3k+1) we observe that

a(ν)=#{(m,n)N2:m2+7n2=8(3k+1),m,n1(mod 2)}.

Moreover, if 7|ν, then a(ν)=a(ν/7). This is clear because if m2+7n2=7s then 7|m which implies that (7(m/7))2+7n2=7s which implies that n2+7(m/7)2=s. Thus every solution to m2+7n2=7s can be transformed into a solution of m2+7n2=s where m=n and n=m/7 and vice versa. Next, let n be a positive integer with 7n and let α be an integer greater than 2. Assume that there exists x,yZ with x,y1(mod 2) such that

x2+7y2=2αn.

We note that the ring Z[1+72] is a unique factorization domain. In particular, we have

2=(1+72)(172).

Assume that

n=p1α1psαs×(a1+7b1)β1(ar+7br)βr(a17b1)β1(ar7br)βr,

where pj,aj±7bj are primes. Set

2α=(1+72)α(172)α.

Note that

(x+7y)(x7y)=2αn.

If rj is maximal such that pjrj|(x+7y), then pjrj|(x7y) which implies that 2rj=αj for j=1,,s. It follows that

(ai+7bi)ji(ai7bi)βiji|(x+7y),

for some ji=0,,βi and i=1,,r. Furthermore, either

(1+72)(172)α1

or

(172)(1+72)α1

divides x+7y. These are the only possibilities that guarantee that x and y are odd. Consequently, in total we have 2j=1r(1+βj) possibilities for x+7y. If out of this we choose only those with x0 we obtain j=1r(1+βj) possibilities. This implies that

a(2αn)=j=1r(1+βj)

where 7n and

a(2α7kn)=j=1r(1+βj).

Thus,

a(2α7kn)1(mod 2)

iff βj is even for all j or equivalently if n is a square. Next note that 2α7kt28(mod24) iff 3t and α3 is even and nonnegative. This implies that

n=0a(n)qnn=0A(n)qn(mod 2),

where

A(n):={1if n=23t2 or n=237t2,3t,k0,0otherwise.

Thus

q1/3n=1(1qn)(1q7n)n=0A(n)qn/24=k=0A(24k+8)qk+1/3.

Hence,

n=1(1qn)(1q7n)k=0A(24k+8)qk=t0,3tq7t213+qt213.

Thanks to the above analysis, we have the following:

Corollary 1.3

For alln0,Δ3(2n+1)1(mod 2)if and only if3n+1=t2or3n+1=7t2.

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 3(7n+3)+1 or 21n+10 can be represented as t2 or 7t2 for some integer t in order to determine the parity of Δ3(14n+7). Note that 21n+10 is not divisible by 7, so it cannot be written in the form 7t2. Moreover, 21n+10 can never be square because 21n+103(mod7) and 3 is a quadratic nonresidue modulo 7. In analogous fashion, Δ3(14n+9)0(mod 2) because 6 is a quadratic nonresidue modulo 7, and Δ3(14n+13)0(mod 2) because 5 is a quadratic nonresidue modulo 7.

We now consider parity results satisfied by Δ3(4n+r) for various values of r.

Theorem 1.4

n=0Δ3(4n)qnn=1(1qn)5(1q7n)(mod 2).

Theorem 1.5

n=0Δ3(4n+2)qnqn=1(1q7n)5(1qn)(mod 2).

Theorem 1.6

n=0Δ3(4n+3)qnn=1(1q2n)(1q14n)(mod 2).

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 n0, Δ3(4(2n+1)+3)(mod 2) or Δ3(8n+7)0(mod 2). 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 q2. Therefore, we can completely characterize the values of Δ3(4n+3) modulo 2 via the remarks made regarding Theorem 1.1.

Our last set of theorems provides information about the parity of Δ3(8n+r) for a number of values of r.

Theorem 1.8

n=0Δ3(8n+1)qnn=1(1q2n)(mod 2).

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 n0, Δ3(16n+9)0(mod 2) immediately. But we actually can say more. Thanks to Eulerʼs Pentagonal Number Theorem [1, Corollary 1.7], we know

n=1(1q2n)=mZ(1)mqm(3m1).

Therefore, we can explicitly state when Δ3(8n+1) is even or odd; namely, for any n0, Δ3(8n+1) is odd if and only if n=m(3m1) for some integer m. This is equivalent to saying Δ3(8n+1) is odd if and only if 12n+1 is a perfect square. This means we can write down numerous Ramanujan-like congruences modulo 2 within the arithmetic progression 8n+1 with ease.

Theorem 1.10

n=0Δ3(8n+2)qnqn=1(1qn)(1q28n)(mod 2).

Theorem 1.11

n=0Δ3(8n+3)qnn=1(1qn)(1q7n)(mod 2).

Remark 1.12

Given Theorem 1.1, we see that Theorem 1.11 clearly implies that, for all n0, Δ3(8n+3)Δ3(2n+1)(mod 2), an attractive “internal” congruence satisfied by Δ3. We will briefly mention this congruence again in our concluding remarks below.

Theorem 1.13

n=0Δ3(8n+4)qnn=1(1q4n)(1q7n)(mod 2).

A remark is in order regarding Theorem 1.10, Theorem 1.13. We have

q124n=1(1qn)=n=(1)nq(6n1)2/24n=q(6n1)2/24(mod 2).

Consequently,

q1124n=1(1q4n)(1q7n)n,mZq4(6n1)2+7(6m1)224(mod 2)

and

q2924n=1(1qn)(1q28n)n,mZq(6n1)2+28(6m1)224(mod 2).

Next we note that

n2+7m211(mod24)n=2k,k,m±1(mod6)

and

n2+7m229(mod24)m=2k,n,k±1(mod6).

For given x with x11(mod 24) the set of solutions (n,m) such that 4n2+7m2=x can be partitioned into equivalence classes and two solutions (n1,m1) and (n2,m2) are equivalent iff n1=±n2 and m1=±m2. In particular each equivalence class has exactly 4 elements and there is only one solution (n1,m1) in each class such that n1=2k1 and (k1,m1)(1,1)(mod 6). This implies in particular that for

n=0b(n)qn:=n,mZqn2+7m2 (1.4)

we have

14n=0b(24n+11)q24n+11=n,mZq4(6n1)2+7(6m1)2.

This implies that

14q1124n=0b(24n+11)qn=n,mZq4(6n1)2+7(6m1)224.

In a similar fashion we conclude that

14q2924n=0b(24n+29)qn=n,mZq(6n1)2+28(6m1)224.

Because of these two relations we observe that in order to understand n=1(1q4n)(1q7n) and n=1(1qn)(1q28n) modulo 2 we need to understand b(n) in (1.4) for n odd. By [4, p. 61, Lemma 3.25] we know that, for m>1 and odd with 7m,

|{x,yZ:gcd(x,y)=1,x2+7y2=m}|=2p|m(1+(7p)).

Let m=ms2mf with mf squarefree. Then we observe immediately that

|{x,yZ:x2+7y2=m}|=2d|msp|md2(1+(7p)).

Consequently,

b(m)=2d|msp|md2(1+(7p)). (1.5)

By using the fact that

|{x,yZ:x2+7y2=7αn}|=|{x,yZ:x2+7y2=n}|

one can lift the restriction that 7m. From (1.5) we observe that b(m)2 is multiplicative for odd m. Because of (1.5), we know for prime p3 that

b(p2α+1)=2(α+1)(1+(7p)),
b(p2α)=2(α(1+(7p))+1).

This now leads to two corollaries which give a characterization of the values of Δ3(8n+2) and Δ3(8n+2), modulo 2, in terms of this function b(n) just described:

Corollary 1.14

For all n0 , Δ3(8n+2)14b(24n+29)(mod 2) .

Corollary 1.15

For all n0 , Δ3(8n+4)14b(24n+11)(mod 2) .

Theorem 1.16

n=0Δ3(8n+5)qnn=1(1q14n)(mod 2).

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 n0, Δ3(16n+13)0(mod 2) 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 q7, we can say that, for all n0, Δ3(56n+r)0(mod 2) for r{13,21,29,37,45,53}.

2. Proof of the congruences

Let

f=a(n)qn:=η(6z)η(21z)η3(3z)η(42z)

and

ϕ:=η(8z)72.

Then

a(n)=Δ3(n+13).

Let

g=b(n)qn.

For χ a character we define

gχ:=χ(n)b(n)qn

and for DZ, ϵ(n):=(Dn) let

gD:=gϵ.

Define the Ud-operator by

Udg:=b(dn)qn.

We need that for F:=A(n)qn, G:=B(n)qnN and χ a character modulo N we have

(FG)χ(z)=Fχ(z)G(z) (2.1)

and

UN(FG)=G(z/N)(UNF)(z). (2.2)

One verifies that our congruences are equivalent to the following:

Thm. 1.1:U2fη(3z)η(21z)(mod 2),Thm. 1.6:U4fη(6z)η(42z)(mod 2),Thm. 1.11:U8fη(3z)η(21z)(mod 2),Thm. 1.5:12(f4+f4)η5(84z)η(12z)(mod 2),Thm. 1.4:12(f4f4)η5(12z)η(84z)(mod 2),Thm. 1.8:12([U2f]4+[U2f]4)η(24z)(mod 2),Thm. 1.16:12([U2f]4[U2f]4)η(168z)(mod 2),Thm. 1.10:14(f4+f4f8f8)η(24z)η(672z)(mod 2),Thm. 1.13:14(f4f4f8+f8)η(96z)η(168z)(mod 2). (2.3)

Next note that ϕ is a series in powers of q8. Let ϕ(s)(z):=ϕ(z/s). In particular note that ϕ(s)(z) is a series in powers of q8/s. Using (2.1) and (2.2) we find

U2(fϕ)=ϕ(2)U2f,U4(fϕ)ϕ(4)U4f,U8(fϕ)ϕ(8)U8f,12((fϕ)4+(fϕ)4)=ϕ12(f4+f4),12((fϕ)4(fϕ)4)=ϕ12(f4f4),12([U2(fϕ)]4+[U2(fϕ)]4)=12([ϕ(2)U2f]4+[ϕ(2)U2f]4)=ϕ(2)12([U2f]4+[U2f]4),12([U2(fϕ)]4[U2(fϕ)]4)=12([ϕ(2)U2f]4[ϕ(2)U2f]4)=ϕ(2)12([U2f]4[U2f]4),14((fϕ)4+(fϕ)4(fϕ)8(fϕ)8)=ϕ14(f4+f4f8f8),14((fϕ)4(fϕ)4(fϕ)8+(fϕ)8)=ϕ14(f4f4f8+f8). (2.4)

Recall that η(τ)2η(2τ)1(mod 2). Then because of (2.4), (2.3) is equivalent to:

Thm. 1.1:(η(τ)2η(2τ))4U2(fϕ)ϕ(2)η(3z)η(21z)(mod 2),Thm. 1.6:(η(τ)2η(2τ))4U4(fϕ)ϕ(4)η(6z)η(42z)(mod 2),Thm. 1.11:(η(τ)2η(2τ))4U8(fϕ)ϕ(8)η(3z)η(21z)(mod 2),Thm. 1.5:(η(τ)2η(2τ))412((fϕ)4+(fϕ)4)(η(τ)2η(2τ))2ϕη5(84z)η(12z)(mod 2),Thm. 1.4:(η(τ)2η(2τ))412((fϕ)4(fϕ)4)(η(τ)2η(2τ))2ϕη5(12z)η(84z)(mod 2),Thm. 1.8:(η(τ)2η(2τ))412([U2(fϕ)]4+[U2(fϕ)]4)ϕ(2)η(24z)ϕ(2)η(12z)2(mod 2),Thm. 1.16:(η(τ)2η(2τ))412([U2(fϕ)]4[U2(fϕ)]4)ϕ(2)η(168z)ϕ(2)η(84z)2(mod 2),Thm. 1.10:(η(τ)2η(2τ))414((fϕ)4+(fϕ)4(fϕ)8(fϕ)8)ϕη(24z)η(672z)(mod 2),Thm. 1.13:(η(τ)2η(2τ))414((fϕ)4(fϕ)4(fϕ)8+(fϕ)8)ϕη(96z)η(168z)(mod 2). (2.5)

Denote by Mk(N,χ) the set of weak modular forms of weight k and character χ for the group Γ0(N). By [6, Thm. 1.64] we have that fϕM35(504,(1d)) and (η(τ)2η(2τ))4M2(4,id). Furthermore, by [6, Prop. 2.8] we have that if gMk(N,χ) and (Dn) is a character modulo m, then gDMk(Nm2,χ). By [6, Prop. 2.22], if gMk(N,χ) and d|N, then UdfMk(N,χ). This implies that the left-hand side of the relations in (2.5) in the first three lines are in M37(504,(1d)), in the next four lines they are in M37(50442,(1d)) and in the last two lines they are in M37(50482,(1d)). 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 3512×11523360 coefficients in their q-expansion. Similarly, the next four identities hold if they hold for 3512×1843253760 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 Δ3(n) modulo powers of 2:

Conjecture

Let

λα={2α+1+13if α is even,2α+13if α is odd.

Then, for all α1 and n0,

Δ3(λα)Δ3(2α+2n+λα+2)Δ3(λα+2)Δ3(2αn+λα)(mod2α)

and

Δ3(λα)1(mod 2).

The case α=1 of this conjecture was proven above; namely, in Remark 1.12, we noted that

Δ3(8n+3)Δ3(2n+1)(mod 2)

for all n0.

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 x2+ny2: 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 (2k+1)-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]

RESOURCES