Abstract
Recently, Sandon and Zanello (Ramanujan J 33: 83–120, 2014) conjectured 29 highly non-trivial colored partition identities. In this paper, we establish 17 of them and prove analogous colored partition identities of the remaining 12 conjectural identities by using the theory of Ramanujan’s theta functions. We also present some new colored partition identities of the same type.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Recently, Sandon and Zanello [12] determined a unified combinatorial framework to look at a large number of colored partition identities, and studied combinatorially the five identities, proved by Berndt [10], corresponding to modular equations of prime degrees 3, 5, 7,11, and 23 of the Schröter, Russell, and Ramanujan type. In [13], they further found several new and highly non-trivial colored partition identities by using their master bijection, i.e., Theorem 2.1 in [12], and conjectured 29 more identities (In fact, they conjectured 30 identities, but analytic proof of one of the identities was already given by Baruah and Berndt in [3, Theorem 8.1]). Their conjectures are formulated in terms of certain sets of integers satisfying the conditions of their master bijection and the partition identities are stated as corollaries. As mentioned by Berndt and Zhou [6], these conjectures and corollaries are different formulations of the same phenomena; their corollaries are not less general than the corresponding conjectures. Three of their conjectured identities are proved analytically by Berndt and Zhou [6] with the help of Ramanujan’s formulas for multipliers. In [7], they proved all the remaining conjectures of Sandon and Zanello [13].
Following Sandon and Zanello [13], for given integers \(C\ge 1\), \(0\le A_i\le C/2\) and \(0\le B_i\le C/2\), let \(S\) be the set containing one copy of all positive integers congruent to \(\pm A_i\) modulo \(C\) for each \(i\), and let \(T\) be the set containing one copy of all positive integers congruent to \(\pm B_i\) modulo \(C\) for each \(i\). Let \(D_S(N)\) (respectively, \(D_T(N)\)) be the number of partitions of \(N\) into distinct elements of S (respectively, T), where such partitions require to have an odd number of parts if no \(A_i\) (respectively, no \(B_i\)) is equal to zero. Then the theorems and conjectures on colored partitions of Sandon and Zanello in [12] and [13] are identities connecting \(D_S(N)\) and \(D_T(N)\). For example, Corollary to Conjecture 3.24 in [13] can be stated as follows.
Conjecture 1.1
Let \(S\) be the set containing one copy of the even positive integers that are not multiples of \(25\), and \(T\) be the set containing one copy of the odd positive integers that are not multiples of \(25\). Then, for any \(N \ge 4\),
Obviously, the above is incorrect for odd \(N\) as \(S\) contains only even elements. The corrected form, which has been proved by Berndt and Zhou [6] by using a 25th degree modular equation of Ramanujan, can be stated as follows.
Theorem 1.2
If \(S\) and \(T\) are as defined in Corollary 1.1, then, for any \(N\ge 2\), the number of partitions of \(2N\) into an odd number of distinct elements of \(S\) is equinumerous to the number of partitions of \(2N-3\) into distinct elements of \(S\).
Berndt and Zhou [6] also proved two similar conjectures of Sandon and Zanello [13] as well as several new partition identities arising from Ramanujan’s formulas for multipliers.
Now, refer to the italicized text in the second paragraph of this introduction. If we do not restrict the parity of the number of partitions into distinct elements of \(S\) (or, \(T\)), then some of the partition identities conjectured by Sandon and Zanello [13] take different forms. The aim of the paper is to present new partition identities without restricting the parity of number of partitions into distinct elements of \(S\) (or, \(T\)). We also prove 17 conjectures of Sandon and Zanello [13] that do not require to restrict the parity of number of partitions into distinct elements of \(S\) (or, \(T\)). These correspond to Corollaries to Conjectures 3.26, 3.32, 3.34–3.38, 3.40, 3.41, 3.43–3.46, and 3.48–3.51 in [13].
In each of our partition identities, the number of partitions of a positive integer \(n\) into distinct elements of a particular set \(A\) will be denoted by \(P_A(n)\). For example, the identity analogous to the previous theorem is
where \(a(N)\) is the difference of the number of partitions of \(N\) into an even number of distinct nonmultiples of 25 and the number of partitions of \(N\) into an odd number of distinct nonmultiples of 25. By Euler’s famous pentagonal number theorem, it is clear that
where, here and in the sequel, for any complex number \(a\) and \(|q|<1\), we define
We extensively employ Ramanujan’s theta function identities to arrive at the partition identities. In the next few paragraphs, we introduce Ramanujan’s theta functions and some preliminary results.
Ramanujan’s general theta function \(f(a,b)\) for \(|ab|<1\) is defined by
If we set \(a = qe^{2iz}\), \(b= qe^{-2iz}\), and \( q = e^{\pi i\tau }\), where \(z\) is complex and \(\text{ Im }(\tau )>0\), then \( f(a,b)=\vartheta _3(z,\tau )\), where \(\vartheta _3(z,\tau )\) denotes one of the classical theta functions in its standard notation. Jacobi’s famous triple product identity can be written as
Three special cases of \(f(a,b)\) are given in the following lemma.
Lemma 1.3
[8, p. 36, Entry 22 ]. If \(|q|<1\), then
where the product representations in the above arise from (1.2).
After Ramanujan, we also define
which is the generating function for the number of partitions of a positive integer into distinct odd parts.
Some more results are given in the next two lemmas.
Lemma 1.4
[8, p. 45, Entry 29]. If \(ab=cd\), then
and
Lemma 1.5
[8, p. 40, Entry 25]. We have
and
Next, we give the definition of a modular equation as understood by Ramanujan. The complete elliptic integral of first kind \(K(k)\) is defined as
where the series representation is found by expanding the integrand in a binomial series and integrating termwise, and \({_2F_1}\left( a, b;c;z\right) \), \(|z|<1\) denotes the ordinary hypergeometric function. The number \(k\) is called the modulus, and \(k^\prime :=\sqrt{1-k^2}\) is called the complementary modulus. Let \(K\), \(K^\prime \), \(L\), and \(L^\prime \) denote complete elliptic integrals of first kind associated with the moduli \(k\), \(k^\prime \), \(\ell \), and \(\ell ^\prime \), respectively. Suppose that the equality
holds for some positive integer \(n\). Then a modular equation of degree \(n\) is a relation between the moduli \(k\) and \(\ell \), which is implied by (1.6). Ramanujan recorded his modular equations in terms of \(\alpha \) and \(\beta \), where \(\alpha =k^2\) and \(\beta =\ell ^2\). We then say that \(\beta \) has degree \(n\) over \(\alpha \). The corresponding multiplier \(m\) is defined by
If \(q = \exp (-\pi K^\prime /K)\), then one of the fundamental results in the theory of elliptic functions [8, Entry 6, p. 101] is given by
where \(\varphi \) is as defined in Lemma 1.3.
The above identity enables one to derive formulas for \(\varphi \), \(\psi \), \(f\), and \(\chi \) at different arguments in terms of \(\alpha \) , \(q\), and \(z := {_2F_1}\left( \frac{1}{2}, \frac{1}{2};1;\alpha \right) \). In particular, Ramanujan recorded the following identities.
Lemma 1.6
[8, pp. 122 – 124, Entries 10–12]. We have
Suppose that \(\beta \) has degree \(n\) over \(\alpha \). If we replace \(q\) by \(q^n\) above, then the same evaluations hold with \(\alpha \) replaced by \(\beta \) and \(z\) replaced by \(z_n := {_2F_1}\left( \frac{1}{2}, \frac{1}{2};1;\beta \right) \).
In the next six sections, we prove 17 of the conjectures in [13] and find analogous partition identities for the remaining 12 conjectures. It would be clear from our proofs of the partition identities that more such colored partition identities could be found. In the last section of this paper, we present some new colored partition identities of the same type.
2 Partition identities analogous to conjectures 3.24, 3.25, and 3.27 of [13]
As mentioned in the previous section, each of the modified versions of Conjectures 3.24, 3.25, and 3.27 of [13] have been proved by Berndt and Zhou [7] by employing a certain kind of Ramanujan modular equation involving multipliers. In this section, we present three analogous partition identities without restricting the parity of the number of distinct elements of \(S\) (and/or, \(T\)). It is worthwhile to mention that the same kind of partition identities may be obtained from other analogous modular equations of Ramanujan involving multipliers.
Theorem 2.1
(Analogs to Corollary to Conjecture 3.24 of [13] and to Theorem 3.3 of [6]) Let \(S\) be the set containing one copy of the even positive integers that are not multiples of \(25\), and \(T\) be the set containing one copy of the odd positive integers that are not multiples of \(25\). Let \(a(N)\) be the difference of the number of partitions of \(N\) into an even number of distinct non multiples of \(25\) and the number of partitions of \(N\) into an odd number of distinct non multiples of \(25\). Then \(P_S(2)=2+a(1)\) and for \(N>1\), we have
Proof
From [8, p. 291, Entry 15(i)], we recall a modular equation of degree 25 as
where \(\beta \) has degree 25 over \(\alpha \), and \(m\) is the multiplier connecting \(\alpha \) and \(\beta \). Transcribing this modular equation, with the aid of Lemma 1.6, we have
which can be transformed into the \(q\)-product identity
Thus,
Equating the coefficients of \(q^{2N}\) from both sides of the above, and noting that
we easily arrive at (2.1).
Corollary 2.2
For \(N\ge 0\),
and, for \(N\ge 1\),
Furthermore,
i.e.,
and
Proof
We recall from [8, p. 82] that
Extracting various terms from both sides of the above, we find that
and
From (2.5) and (2.1), we arrive at (2.2)–(2.4).
Next, let \(\gamma (n)\) and \(\delta (n)\) be defined by
and
where \(R(q)\) is the famous Rogers-Ramanujan continued fraction, defined by
The coefficients \(\gamma (n)\) and \(\delta (n)\) have been extensively studied by various authors. We refer to Chapt. 4 of [1] for many references. In particular, from [1, pp. 111–113, Corollary 4.2.1 and Corollary 4.2.2], we have
Therefore,
which completes the proof. \(\square \)
Theorem 2.3
(Analogs to Corollary to Conjecture 3.25 of [13] and to Theorem 2.7 of [6]) Let \(S\) be the set containing \(2\) copies of the even positive integers that are not multiples of \(13\), and \(T\) be the set containing \(2\) copies of the odd positive integers that are not multiples of \(13\). Let \(a(N)\) be the difference of the number of 2-colored partitions of \(N\) into an even number of distinct non multiples of \(13\) and the number of 2-colored partitions of \(N\) into an odd number of distinct non multiples of \(13\). Then \(P_S(2)=4+a(1)\) and for any \(N>1\),
Proof
If \(\beta \) has degree 13 over \(\alpha \), and \(m\) is the multiplier connecting \(\alpha \) and \(\beta \), then from [8, p. 376, Entry 8(iii)], we have
which can be transcribed, with the help of the identities in Lemma 1.6, into
The above can be further transformed into
Thus,
Now, the generating function of \(a(n)\) is given by
Therefore, equating the coefficients of \(q^{2N}\) from both sides of (2.8), we easily arrive at the desired identity to complete the proof.
Theorem 2.4
(Analogs to Corollary to Conjecture 3.27 of [13] and to Theorem 2.5 of [6]) Let S be the set containing \(4\) copies of the even positive integers that are not multiples of \(7\), and T the set containing \(4\) copies of the odd positive integers that are not multiples of \(7\). Furthermore, let \(a(N)\) be the difference of the number of 4-colored partitions of \(N\) into an even number of distinct non multiples of \(7\) and the number of 4-colored partitions of \(N\) into an odd number of distinct non multiples of \(7\). Then
Proof
First of all, we note that
Next, if \(\beta \) has degree \(7\) over \(\alpha \), and \(m\) is the multiplier connecting \(\alpha \) and \(\beta \), then, from [8, p. 314, Entry 19(v)]
which can be transcribed, with the help of Lemma 1.6, into
Transforming the theta functions into \(q\)-products, with the aid of Lemma 1.3, we find that
which can be written as
Equating the coefficients of \(q^{2N}\) from both sides of the above, we easily arrived at (2.9) to complete the proof. \(\square \)
3 Conjectures 3.51 and 3.26 of [13]
Theorem 3.1
(Corollary to Conjecture 3.51 of [13]) Let \(S\) be the set containing one copy of the even positive integers, \(2\) copies of the odd positive integers, one more copy of the positive multiples of \(14\), and \(2\) more copies of the odd positive multiples of \(7\); let \(T\) be the set containing \(2\) copies of the even positive integers, one copy of the odd positive integers, \(2\) more copies of the positive multiples of \(14\), and one more copy of the odd positive multiples of \(7\). Then, for any \(N\ge 1\),
or equivalently,
Proof
We recall from Berndt’s book [8, p. 304] that
Transforming this into \(q\)-products with the aid of Lemma 1.3 and canceling \((q^2;q^2)_\infty (q^{14};q^{14})_\infty \) from both sides, we find that
Multiplying both sides by \((-q^2;q^2)_\infty (-q^{14};q^{14})_\infty \) and then using Euler’s identity \((-q;q)_\infty =(q;q^2)^{-1}_\infty \), we obtain
which is equivalent to
Equating the coefficients of \(q^N\), we arrive at the desired result. \(\square \)
Conjecture 3.2
(Corollary to Conjecture 3.26 of [13]) Let \(S\) be the set containing \(3\) copies of the odd positive integers and \(3\) more copies of the odd positive multiples of \(7\), and \(T\) the set containing \(3\) copies of the even positive integers and \(3\) more copies of the positive multiples of \(14\). Then, for any \(N\ge 3\),
Obviously, the above conjecture is not true when \(N\) is even as \(T\) contains only even elements. We prove the following modified version of the conjecture.
Theorem 3.3
Let \(S\) and \(T\) be as defined in Conjecture 3.2. Then, for any \(N\ge 1\),
or equivalently,
Proof
Cubing (3.1), we find that
which can be transformed, with the aid of Lemma 1.3, into
Dividing both sides of the above identity by \((q^2;q^2)^3_\infty (q^{14};q^{14})^3_\infty (-q;q^2)^3_\infty (-q^7;q^{14})^3_\infty \) and then using the trivial identity \((q^2;q^4)_\infty =(q;q^{2})_\infty (-q;q^2)_\infty \), we arrive at
which by Euler’s identity \((-q;q)_\infty =(q,q^2)^{-1}_\infty \) reduces to
Thus,
or
Comparing the coefficients of \(q^{2N+1}\) from both sides of the above identities, we readily arrive at (3.2) and (3.3) to complete the proof.
Remark 3.4
The above two theorems have also been proved by Berndt and Zhou [7] by using Ramanujan’s modular equations.
4 Partition identities in conjectures 3.38, 3.28, 3.30, and 3.42 of [13]
Conjecture 4.1
(Corollary to Conjecture 3.38 of [13]) Let \(S\) be the set containing \(3\) copies of the odd positive integers that are not multiples of \(3\), one copy of the odd positive multiples of \(3\) that are not multiples of \(9\), and \(4\) copies of the odd positive multiples of \(9\); let \(T\) be the set containing \(3\) copies of the even positive integers that are not multiples of \(3\), one copy of the positive multiples of \(6\) that are not multiples of \(18\), and \(4\) copies of the positive multiples of \(18\). Then, for any \(N\ge 3\),
Obviously, Conjecture 4.1 is incorrect for even \(N\) as \(T\) contains only even elements. We find the following modified result.
Theorem 4.2
If \(S\) and \(T\) are as defined in Conjecture 4.1, then \(D_S(1)=3\) and for \(N>1\),
or equivalently,
Proof
First we recall from [8, p. 49, Corollary (ii)] that
Now, by Jacobi triple product identity, (1.2), and the definition of \(\varphi \) and \(\chi (q)\), we have
With the help of the above, we rewrite (4.3) as
Replacing \(q\) by \(-q\) and then employing the trivial identity \(\chi ^3(q)=\varphi (q)/\psi (-q)\), we have
Again, from [9, p. 202, Entry 50(i)], we recall that
Multiplying the previous two identities, we have
Next, by [8, p. 358, Entries 4(i) and (ii)],
and
Replacing \(q\) by \(-q\) in (4.8) and then subtracting from (4.8) and using the above two identities, we obtain
Now, by [8, p. 49, Corollary (i)],
Noting by (1.2), that
we rewrite the previous identity as
i.e.,
Again, by [2, Eq. (3.37)],
Multiplying the above two identities and then replacing \(q\) by \(-q^2\), we find that
Employing (4.11) in (4.9), we obtain
The above identity can be rewritten as
or
Equating the coefficients of \(q^{2N+1}\) from both sides of the above identities, we readily arrive at (4.1) and (4.2) to finish the proof.
Remark 4.3
The identity (4.1) has also been established by Berndt and Zhou [7] by using Ramanujan’s modular equations.
Conjecture 4.4
(Corollary to Conjecture 3.28 of [13]) Let \(S\) be the set containing \(3\) copies of the even positive integers that are not multiples of \(9\), and T be the set containing \(3\) copies of the odd positive integers that are not multiples of \(9\). Then, for any \(N\ge 4\),
Obviously, Conjecture 4.4 is incorrect for odd \(N\) as \(S\) contains only even elements. For even \(N\), the conjecture is proved by Berndt and Zhou [7]. Here we find the following analogous result.
Theorem 4.5
Let \(S\) and \(T\) be as defined in Conjecture 4.4 and let \(a(N)\) be the difference of the number of 3-colored partitions of \(N\) into an even number of distinct nonmultiples of \(9\) and the number of 3-colored partitions of \(N\) into an odd number of distinct nonmultiples of \(9\). Then, \(P_S(2)=3+a(1)\) and for \(N>1\), we have
Proof
Note that
Multiplying (4.5) by \(\varphi (q^9)\) and (4.10) by \(q\psi (q^9)\) and then subtracting the second from the first, we have
where we have also used the trivial identities \(\chi (q)\chi (-q)=\chi (-q^2)\), \(\varphi (q)\varphi (-q)=\varphi ^2(-q^2)\), and \(\psi (q)\psi (-q)=\psi (q^2)\varphi (-q^2)\). Replacing \(q\) by \(-q^2\) in (4.10) and then using it in the above identity, we obtain
Cubing, we have
Dividing both sides of the above by \(\psi ^3(q)\psi ^3(q^9)\) and using \(\dfrac{\varphi (q)}{\psi (q)}=\chi (q)\chi (-q^2)\) and then simplifying further, we find that
Replacing \(q\) by \(-q\) in (4.15) and then adding the resulting identity with (4.15), we have
Now, Ramanujan’s third degree modular equation
can be transformed into (see [3], Theorem 4.1)
Multiplying both sides of the above by \(\dfrac{f(-q^2)}{f^3(-q^6)}\) and noting that \(f(-q)=\chi (-q)f(-q^2)\), we find that
Employing the above, with \(q\) replaced by \(q^3\), in (4.16), we obtain
which can be recast as
where
and
From (4.12) and (4.17), we have
and
Multiplying (4.19) and (4.20), we find that
Multiplying (4.18) by \(2\) and then subtracting (4.21), we obtain
We want a simplified expression for \(A-8q^6\dfrac{\chi ^3(-q^6)}{\chi ^3(-q^2)\chi ^6(-q^{18})}\). We do this by employing some results involving Ramanujan’s cubic continued fraction [8, p. 345], \(G(q)\), defined by
We note from [1, pp. 95–96, Theorem 3.3.1] that
and
Now, by (4.6) and (4.7), we have
and
Multiplying the above two identities, we obtain
Thus,
where (4.24)–(4.26) have also been utilized to arrive at the last expression.
But, by [8, p. 95, Entry 1(iv)],
Employing the above, with \(q\) replaced by \(q^6\), in (4.27), we have
and hence, (4.22) reduces to
In terms of \(P_S(n)\), \(P_T(n)\), and \(a(n)\), the above can be recast as
Equating the coefficient of \(q^{2N}\) from both sides of the above, we arrived at the desired result. \(\square \)
Theorem 4.6
(Corollary to Conjecture 3.30 of [13]) Let \(S\) be the set containing one copy of the odd positive integers that are not multiples of \(9\) and \(2\) copies of the even positive integers that are not multiples of \(9\), and \(T\) be the set containing \(2\) copies of the odd positive integers that are not multiples of \(9\) and one copy of the even positive integers that are not multiples of \(9\). Then, for any \(N\ge 2\),
Berndt and Zhou [7] proved the above theorem. Here we present an analogous theorem involving \(P_S(n)\) and \(P_T(n)\).
Theorem 4.7
If \(S\) and \(T\) are as defined in Conjecture 4.6, then
where
with \(C(q)=q^{-1/3}G(q),\) where \(G(q)\) is Ramanujan’s cubic continued fraction as defined by (4.23).
Furthermore, \(a(n)\) is nonzero except if \(n=5\) and \(8\).
Proof
Transforming the theta functions in (4.14) into \(q\)-products by using Lemma 1.3, we find that
In terms of \(P_S(n)\) and \(P_T(n)\), the above can be written as
Equating the coefficients of \(q^{3N+1}\), \(q^{3N+2}\), and \(q^{3N}\), from both sides of the above, we readily arrive at (4.28)–(4.30), respectively.
Now, Hirschhorn and Roselin [11, Theorem 1.5] proved that \(a_{6n}>0\), \(a_{6n+1}>0\), \(a_{6n+2}>0\), \(a_{6n+3}<0\), \(a_{6n+4}<0\), \(a_{6n+5}<0\) except \(a_5=a_8=0\). Thus, we finish the proof. \(\square \)
Theorem 4.8
(Analog to Corollary to Conjecture 3.42 of [13]) Let \(S\) be the set containing \(2\) copies of the positive integers that are not multiples of \(4\), and \(2\) more copies of the positive multiples of \(3\) that are not multiples of \(4\); let \(T\) be the set containing \(2\) copies of the positive integers that are not congruent to \(2\) modulo \(4\), and \(2\) more copies of the positive multiples of \(3\) that are not congruent to \(2\) modulo \(4\). Then \(P_S(1)=2\) and for \(N\ge 1\),
Proof
We recall from [8, p. 232] that
which can be transformed into
Replacing \(q\) by \(q^2\) in the above, multiplying both sides of the resulting identity by \((-q;q^2)_\infty ^2(-q^3;q^6)_\infty ^2\) and then using Euler’s identity and the trivial identity \((-q;q^2)_\infty (q;q^2)_\infty =(q^2;q^4)_\infty \), we find that
We rewrite the above as
Replacing \(q\) by \(-q\) in (4.32) and then subtracting the resulting identity from (4.32), we have
Employing (4.31) in (4.33), we arrive at
Equating the coefficients of \(q^{2N+1}\) from both sides, we complete the proof. \(\square \)
5 Conjectures 3.32, 3.33, 3.31, 3.35–3.37 and 3.52 of [13]
Theorem 5.1
(Corollary to Conjecture 3.32 of [13]) Let \(S\) be the set containing \(2\) copies of the positive integers that are either odd or multiples of \(8\), and \(7\) copies of the positive integer that are congruent to \(2\) modulo \(4\); let \(T\) be the set containing \(4\) copies of the positive integers that are either odd or multiples of \(8\), and \(2\) copies of the positive integers that are congruent to \(2\) modulo \(4\). Then, for any \(N\ge 1\),
or equivalently,
Proof
By Lemma 1.5,
Thus,
Adding \(\varphi (-q)\) to both sides of the above and then using Lemma 1.5 again, we have
Dividing both sides by \(\varphi (-q)\),
which can be transformed into
where we also applied Euler’s identity \((-q;q)_\infty =(q;q^2)_\infty ^{-1}\) and the trivial identity \((q;q^2)_\infty (-q;q^2)_\infty =(q^2;q^4)_\infty \).
Since the above is equivalent to
or equivalently,
equating the coefficients of \(q^N\) from both sides, we readily arrive at the desired result.
\(\square \)
Theorem 5.2
(Corollary to Conjecture 3.33 of [13]) Let \(S\) be the set containing \(4\) copies of the positive integers that are either odd or congruent to \(4\) modulo \(8\), and \(2\) copies of the positive integers that are congruent to \(2\) modulo \(4\); let \(T\) be the set containing \(2\) copies of the positive integers that are either odd or multiples of \(8\), and \(7\) copies of the positive integers that are congruent to \(2\) modulo \(4\). Then, for any \(N\ge 2\),
The above theorem has been proved by Berndt and Zhou [7]. In the following theorem we prove an analogous result.
Theorem 5.3
If \(S\) and \(T\) are as defined in Theorem 5.2, then \(P_S(1)=4\), \(P_T(0)=1\), and for \(N\ge 1\),
and
where
Proof
It is easy to see, or by Lemma 1.5,
Multiplying both sides by \(\varphi ^2(q^2)\) and again using the identities of Lemma 1.5, we have
i.e.,
Dividing both sides by \(\varphi (-q)\psi ^2(q^4)\) and simplifying by using \(\varphi (q)\psi (q^2)=\psi ^2(q)\), we find that
Expressing the above in \(q\)-products, we have
which is equivalent to
Equating the coefficients of \(q^{2N+1}\) and \(q^{2N}\) on both sides, we easily arrive at (5.2) and (5.3), respectively. \(\square \)
Theorem 5.4
(Corollary to Conjecture 3.31 of [13]) Let \(S\) be the set containing \(4\) copies of the positive integers that are either odd or congruent to \(4\) modulo \(8\), and \(2\) copies of the positive integers that are congruent to \(2\) modulo \(4\); let \(T\) be the set containing \(4\) copies of the positive integers that are either odd or multiples of \(8\), and \(2\) copies of the positive integers that are congruent to \(2\) modulo \(4\). Then, for any \(N\ge 2\),
A proof of the above theorem can be found in Berndt and Zhou [7]. We find the following result.
Theorem 5.5
If \(S\) and \(T\) are as defined in Theorem 5.4, then \(P_S(1)=4\) and for \(N\ge 1\),
where \(a(n)\) is as defined in (5.4).
Proof
and
Thus,
which is equivalent to
Equating the coefficient of \(q^{2N+1}\) and \(q^{2N}\) from both sides, we readily deduce (5.7) and (5.8). \(\square \)
Theorem 5.6
(Corollary to Conjecture 3.35 of [13]) Let \(S\) be the set containing \(2\) copies of the odd positive integers, \(3\) copies of the positive integers that are congruent to \(2\) modulo \(4\), \(6\) copies of the positive integers that are congruent to \(4\) modulo \(8\), and \(4\) copies of the positive multiples of \(8\); let \(T\) be the set containing \(2\) copies of the odd positive integers, \(3\) copies of the positive integers that are congruent to \(2\) modulo \(4\), \(4\) copies of the positive integers that are congruent to \(4\) modulo \(8\), and \(6\) copies of the positive multiples of \(8\). Then, for any \(N\ge 1\),
or equivalently,
Proof
Replacing \(q\) by \(-q\) in (5.5) and then dividing both side by \(\varphi (-q)\), we have
which can be transformed into
Thus,
or equivalently,
Equating the coefficients of \(q^N\) from both sides, we arrive at the desired result. \(\square \)
Theorem 5.7
(Corollary to Conjecture 3.36 of [13]) Let \(S\) be the set containing \(2\) copies of the positive integers and \(2\) more copies of the odd positive integers; let \(T\) be the set containing \(2\) copies of the odd positive integers, \(3\) copies of the positive integers that are congruent to \(2\) modulo \(4\), \(4\) copies of the positive integers that are congruent to \(4\) modulo \(8\), and \(6\) copies of the positive multiples of \(8\). Then, for any \(N\ge 1\),
or equivalently,
Proof
From Lemma 1.5,
Dividing both sides by \(\varphi (-q)\) and then transforming into \(q\)-products, we find that
Since the above is equivalent to
or, equivalent to
we complete the proof by comparing the coefficients of \(q^N\) from both sides. \(\square \)
Theorem 5.8
(Corollary to Conjecture 3.37 of [13]) Let \(S\) be the set containing \(2\) copies of the odd positive integers, \(3\) copies of the positive integers that are congruent to \(2\) modulo \(4\), \(6\) copies of the positive integers that are congruent to \(4\) modulo \(8\), and \(4\) copies of the positive multiples of \(8\); let \(T\) be the set containing \(2\) copies of the positive integers and \(2\) more copies of the odd positive integers. Then, for any \(N\ge 1\),
or equivalently,
Proof
It is easy to see, or by Lemma 1.5,
which can be transformed into
Dividing both sides by \(2(q;q^2)_\infty ^2\), and then employing Euler’s theorem \((q;q^2)_\infty =(-q;q)_\infty ^{-1}\), we find that
which can be rewritten in either of the forms
and
Comparing the coefficients of \(q^N\) from both sides, we finish the proof. \(\square \)
Theorem 5.9
(Corollary to Conjecture 3.52 of [13]) Let \(S\) be the set containing \(2\) copies of the odd positive integers, one copy of the even positive integers that are not multiples of \(16\), and one more copy of the positive odd multiples of \(8\); let \(T\) be the set containing \(2\) copies of the odd positive integers, one copy of the even positive integers that are not odd multiples of \(8\), and one more copy of the positive multiples of \(16\). Then, for any \(N\ge 2\),
Theorem 5.9 has been proved by Berndt and Zhou [7]. We present the following result involving \(P_S(n)\) and \(P_T(n)\).
Theorem 5.10
If \(S\) and \(T\) are as defined in Theorem 5.9, then \(P_S(1)=2\), and for \(N\ge 1\),
where
Proof
With repeated applications of the identities in Lemma 1.5, we have
Hence,
Dividing both sides by \(\varphi (-q^2)\varphi (q^8)\psi (q^8)\), we have
which can be transformed into
Thus,
Equating the coefficients of \(q^{4N+1}\), \(q^{4N+2}\), \(q^{4N+3}\), and \(q^{4N}\) from both sides of the above, we finish the proof. \(\square \)
6 Conjectures 3.39 and 3.40 of [13]
Theorem 6.1
(Corollary to Conjecture 3.39 of [13]) Let \(S\) be the set containing \(2\) copies of the positive integers that are not multiples of \(10\), one more copy of the odd positive integers, and one more copy of the odd positive multiples of \(5\); let \(T\) be the set containing \(2\) copies of the positive integers that are not odd multiples of \(5\), one more copy of the even positive integers, and one more copy of the positive multiples of \(10\). Then, for any \(N\ge 2\),
Berndt and Zhou [7] have proved Theorem 6.1. Here we give an analogous result.
Theorem 6.2
If \(S\) and \(T\) are as defined in Theorem 6.1, then \(P_S(1)=2+b(1)\) and for \(N>1\)
where
Proof
Recall from [3, p. 1039, Eq. (7.16)] that
Employing Euler’s identity \((-q;q)_\infty =(q;q^2)^{-1}_\infty \), the above can be written as
Thus,
Equating the coefficients of \(q^{N}\) from both sides, we finish the proof. \(\square \)
Theorem 6.3
(Corollary to Conjecture 3.40 of [13]) Let \(S\) be the set containing \(3\) copies of the even positive integers, one copy of the odd positive integers, \(3\) more copies of the odd positive multiples of \(5\), and one more copy of the positive multiples of \(10\); let \(T\) be the set containing \(3\) copies of the odd positive integers, one copy of the even positive integers, one more copy of the odd positive multiples of \(5\), and \(3\) more copies of the positive multiples of \(10\). Then, for any \(N \ge 1\),
or equivalently,
Proof
From [1, p. 28, Entries 1.7.1 (i), (iv)], we have
and
where \(R(q)\) is the Rogers–Ramanujan continued fraction as defined in (2.6). Multiplying the above identities and simplifying by using the trivial identity \(\varphi (q)\psi (q^2)=\psi ^2(q)\), we find that
Since, by [8, p. 262, Entry 10(v)],
identity (6.1) reduces to
Now, setting \(a=q\), \(b=q^4\), \(c=q^2\), and \(d=q^3\) in (1.3), we have
But, by Jacobi’s triple product identity, (1.2),
and hence, from (6.3), we have
Employing (6.4) in (6.2), we find that
Now, \(R(q)\) has the product representation
and therefore,
On the other hand, by employing Jacobi’s triple product identity, (1.2), and changing the base to \(q^{20}\), we have
and hence, from (6.5),
The above is equivalent to
Dividing both sides by \((q;q)_\infty (q^5;q^5)_\infty \) and then employing \((q;q)_\infty =(q;q^2)_\infty (q^2;q^2)_\infty \) and Euler’s identity, we find that
Since the above can put either of the forms
and
we complete the proof by equating the coefficients of \(q^N\) from both sides of the above two identities. \(\square \)
7 Conjectures 3.34, 3.29, 3.41, 3.43–3.50 of [13]
Theorem 7.1
(Corollary to Conjecture 3.34 of [13]) Let \(S\) be the set containing one copy of the positive integers congruent to \(\pm 1\) modulo \(6\), \(5\) copies of the positive integers congruent to \(\pm 2\) modulo \(6\), and \(6\) copies of the positive multiples of \(3\); let \(T\) be the set containing \(5\) copies of the positive integers congruent to \(\pm 1\) modulo \(6\), one copy of the positive integers congruent to \(\pm 2\) modulo \(6\), and \(6\) copies of the positive multiples of \(3\). Then, for any \(N\ge 1\),
or equivalently,
Proof
Adding (1.3) and (1.4), we find that
Setting \(a=q\), \(b=q^5\), \(c=q^3\), and \(d=q^3\) in the above,
Replacing \(q\) by \(-q\), we have
Multiplying the previous two identities, we find that
Now, setting \(a=q\), \(b=q^5\), \(c=-q\), and \(d=-q^5\) in (7.1) and noting that \(f(-1,u)=0\), we have
Using the above in (7.4), we obtain
Replacing \(q^2\) by \(q\) in (7.6) and then noting, by (1.2), that
we have
Dividing both sides by the last expression, employing (1.2), and then simplifying, we deduce that
where, here and in the sequel,
Since (7.7) can be written
or equivalently,
we complete the proof by equating the coefficients of \(q^N\) from both sides. \(\square \)
Theorem 7.2
(Analog to Corollary to Conjecture 3.29 of [13]) Let \(S\) be the set containing \(4\) copies of the positive integers that are either congruent to \(\pm 1\) modulo \(6\) or to \(\pm 4\) modulo \(12\), and \(T\) be the set containing \(4\) copies of the positive integers that are either congruent to \(\pm 1\) modulo \(6\) or to \(\pm 2\) modulo \(12\). Then, \(P_S(1)=4\) and for \(N\ge 1\),
Furthermore, let \(U\) be the set containing one copy of the even positive integers and one more copy of the even positive multiples of \(3\), \(V\) be the set containing two copies of the odd positive integers and two more copies of the odd positive multiples of \(3\), \(W\) be the set containing two copies of the even positive integers and two more copies of the even positive multiples of \(3\). If \(S^\prime =S\cup U\) and \(T^\prime =T\cup U\), then
Proof
Dividing both sides of (7.6) by \(f^4(-q^{12})\) and then transforming into \(q\)-products, we find that
Multiplying both sides of the above by \((-q^{\pm 1};q^{6})^4_\infty \) and then simplifying by using Euler’s identity, we have
which can be put in the form
Replacing \(q\) by \(-q\) in (7.10) and then subtracting the identity from (7.10), we have
Now, we note from [14, p. 84, Corollary 3.3] that
Squaring, we have
Replacing \(q\) by \(-q\) in (7.12) and then subtracting the resulting identity from (7.12), we find that
which can be transformed into
from which, by equating the coefficients of \(q^{2N+1}\) from both sides, we arrive at (7.8).
Now we prove (7.9).
Replacing \(q\) by \(-q\) in (7.10) and then adding the resulting identity with (7.10), we find that
i.e.,
Again, replacing \(q\) by \(-q\) in (7.12) and then adding the resulting identity with (7.12), we have
which is equivalent to
Employing the above identity in (7.14), we have
Equating the coefficients of \(q^{2N}\) from both sides of the above and noting that
and
we readily arrive at (7.9) to finish the proof.
Corollary 7.3
If \(S^\prime \) and \(T^\prime \) are defined in Theorem 7.2, then
and
Proof
It is known from Berndt’s paper [10, Theorem 3.1] that \(P_V(2N+1)=2P_W(2N)\). Therefore, from (7.9),
and
since \(P_W(2N-1)=0\) as \(W\) contains only even elements. \(\square \)
Theorem 7.4
(Corollary to Conjecture 3.41 of [13]) Let \(S\) be the set containing \(2\) copies of the even positive integers, \(2\) more copies of the positive integers congruent to \(\pm 2\) modulo \(12\), and \(4\) copies of the odd multiples of \(3\); let \(T\) be the set containing \(2\) copies of the even positive integers, \(4\) more copies of the positive multiples of \(12\), one copy of the odd positive integers, and one more copy of the odd multiples of \(3\). Then, for any \(N\ge 2\),
or equivalently,
Proof
Setting \(a=q\), \(b=q^5\), \(c=-q^3\), and \(d=-q^3\) in (1.4), we have
Multiplying both sides of (7.15) by \(\varphi (-q^3)\) and then adding \(\varphi ^2(q^3)f(q,q^5)\) to both sides, we find that
Again applying (7.15) and the third identity of Lemma 1.5, with \(q\) replaced by \(q^3\), in (7.16), we find that
Dividing both sides of the above by \(\varphi (-q^3)f^2(-q^2,-q^{10})\) and then transforming to \(q\)-products, we obtain
which is clearly
or equivalently,
Equating the coefficients of \(q^N\) from both sides of the above, we find the desired result. \(\square \)
Theorem 7.5
(Corollary to Conjecture 3.44 of [13]) Let \(S\) be the set containing one copy of the positive integers that are not odd multiples of \(6\), one more copy of the positive multiples of \(3\) that are not odd multiples of \(6\), \(2\) more copies of the positive integers that are congruent to \(\pm 2\) modulo \(12\), and \(3\) more copies of the positive integers that are congruent to \(\pm 4\) modulo \(12\); let \(T\) be the set containing \(2\) copies of the positive integers that are not congruent to \(6\) or \(\pm 4\) modulo \(12\), one copy of the positive integers that are congruent to \(\pm 4\) modulo \(12\), and one more copy of the positive integers that are congruent to \(\pm 1\) modulo \(6\). Then, for any \(N\ge 1\),
or equivalently,
Proof
Setting, in turn, \(a=c=q\), \(b=d=q^5\) and \(a=c=q\), \(b=d=q^2\), in Lemma 1.4, we have
and
Multiplying (7.18) by \(qf(q^2,q^{10})\) and then using (7.20) with \(q\) replaced by \(q^2\), we find that
where (7.3) is used to get the last equality.
Employing (7.22) in (7.21), we obtain
Multiplying the equation by \(f(q^4,q^8)\) and then transforming the terms into \(q\)-products, and then simplifying further, we find that
Thus,
or equivalently,
Equating the coefficients of \(q^N\) from both sides, we complete the proof. \(\square \)
Theorem 7.6
(Analog to Corollary to Conjecture 3.45 of [13]) Let \(S\) be the set containing \(2\) copies of the positive integers that are not congruent to \(0\) or \(\pm 2\) modulo \(12\), one copy of the positive integers that are congruent to \(\pm 2\) modulo \(12\), and one more copy of the positive integers that are congruent to \(\pm 1\) modulo \(6\); let \(T\) be the set containing one copy of the positive integers that are not odd multiples of \(6\), one more copy of the positive multiples of \(3\) that are not odd multiples of \(6\), \(2\) more copies of the positive integers that are congruent to \(\pm 2\) modulo \(12\), and \(3\) more copies of the positive integers that are congruent to \(\pm 4\) modulo \(12\). Then, for any \(N\ge 1\),
and
where
Proof
From (7.17)–(7.20) and Lemma 1.5, we have
Transforming the above into \(q\)-products, multiplying both sides by \((-q;q)_\infty (-q^{\pm 4};q^{12})_\infty /(-q^6;q^{12})^2_\infty \) and then simplifying further, we deduce that
which also states that
where \(a(n)\) is as defined in (7.26). Equating the coefficients of \(q^{2N}\) and \(q^{2N+1}\) from both sides of (7.28), we deduce (7.24) and
respectively.
But, by (4.17), we have
Equating the coefficients of \(q^{2N+1}\) from both sides of the above, we have \(a(1)=1\) and for \(n\ge 1\), \(a(2n+1)=0\), and therefore, (7.29) reduces to (7.25). \(\square \)
Theorem 7.7
(Analog to Corollary to Conjecture 3.43 of [13]) Let \(S\) be the set containing \(2\) copies of the positive integers that are not congruent to \(0\) or \(\pm 2\) modulo \(12\), one copy of the positive integers that are congruent to \(\pm 2\) modulo \(12\), and one more copy of the positive integers that are congruent to \(\pm 1\) modulo \(6\); let \(T\) be the set containing \(2\) copies of the positive integers that are not congruent to \(6\) or \(\pm 4\) modulo \(12\), one copy of the positive integers that are congruent to \(\pm 4\) modulo \(12\), and one more copy of the positive integers that are congruent to \(\pm 1\) modulo \(6\). Then, for any \(N\ge 1\),
and
where \(a(n)\) is as defined in (7.26).
Proof
Define
From (7.23) and (7.27), we have
and
where \(a(n)\) is defined by (7.26). It is easily seen from the above that
which is equivalent to
where \(S\) and \(T\) are as given in the statement of the theorem. Equating the coefficients of \(q^{2N}\) and \(q^{2N+1}\), respectively, from both sides of the above, and also noting that \(a(2N+1)=0\), we readily arrive at (7.30) and (7.31) to complete the proof.\(\square \)
Theorem 7.8
(Corollary to Conjecture 3.46 of [13]) Let \(S\) be the set containing \(2\) copies of the positive integers that are not odd multiples of \(3\), one more copy of the positive integers that are congruent to \(\pm 2\) modulo \(12\), and \(2\) more copies of the positive odd multiples of \(6\); let \(T\) be the set containing \(2\) copies of the positive integers that are not odd multiples of \(3\), one more copy of the positive integers that are congruent to \(\pm 4\) modulo \(12\), and \(2\) more copies of the positive multiples of \(12\). Then, for any \(N\ge 1\),
or equivalently,
Proof
Replacing \(q\) by \(q^2\) in (7.2), we have
But, from [8, p. 46, Entries 30(ii) and 30(iii)],
Employing (7.33) in (7.32), we obtain
Transforming into \(q\)-products and then simplifying, we find that
i.e.,
or equivalently,
The proffered partition identity of the theorem follows immediately. \(\square \)
Theorem 7.9
(Analog to Corollary to Conjecture 3.47 of [13]) Let \(S\) be the set containing \(2\) copies of the positive integers that are not congruent to \(2\) modulo \(4\), one more copy of the positive integers that are congruent to \(\pm 1\) modulo \(6\), and one more copy of the positive integers that are congruent to \(\pm 4\) modulo \(12\); let \(T\) be the set containing \(2\) copies of the positive integers that are not multiples of \(4\), one more copy of the positive integers that are congruent to \(\pm 1\) modulo \(6\), and one more copy of the positive integers that are congruent to \(\pm 2\) modulo \(12\). Then, for any \(N>2\)
where \(U(N)\) is defined by
Proof
Baruah and Nath [5, Eq. 3.17] proved that
Replacing \(q\) by \(q^2\) and then multiplying both sides by \(f(q,q^5)\), we find that
Transforming into \(q\)-products and simplifying, we have
Multiplying both sides of the above by \((-q;q^2)^2_\infty \) and simplifying by using Euler’s identity, we find that
which is equivalent to
Equating the coefficients of \(q^{N}\) from both sides, we easily arrive at the desired identity. \(\square \)
Theorem 7.10
(Corollary to Conjecture 3.49 of [13]) Let \(S\) be the set containing \(2\) copies of the positive multiples of \(6\), \(2\) copies of the positive integers that are congruent to \(\pm 1\) modulo \(6\), one copy of the positive integers that are congruent to \(\pm 2\) modulo \(6\), and \(4\) copies of the odd positive multiples of \(3\); let \(T\) be the set containing \(4\) copies of the positive multiples of \(6\), one copy of the positive integers that are congruent to \(\pm 1\) modulo \(6\), one copy of the positive integers that are congruent to \(\pm 2\) modulo \(6\), \(2\) more copies of the positive integers that are congruent to \(\pm 2\) modulo \(12\), and \(2\) copies of the odd positive multiples of \(3\). Then, for any \(N\ge 1\),
or equivalently,
Proof
Setting \(a=q\), \(b=q^5\), \(c=q^3\), and \(d=q^3\) in (1.4), we have
which can be rewritten, with the aid of the Jacobi triple product identity, (1.2), as
where Euler’s identity is used in the last equality. The above can be put in the form
which is
or equivalently,
Equating the coefficients of \(q^N\) from both sides of the above two identities, we complete the proof. \(\square \)
Theorem 7.11
(Corollary to Conjecture 3.50 of [13]) Let \(S\) be the set containing \(4\) copies of the positive multiples of \(6\), one copy of the positive integers that are congruent to \(\pm 1\) modulo \(6\), one copy of the positive integers that are congruent to \(\pm 2\) modulo \(6\), \(2\) more copies of the positive integers that are congruent to \(\pm 4\) modulo \(12\), and \(2\) copies of the odd positive multiples of \(3\); let \(T\) be the set containing \(2\) copies of the positive multiples of \(6\), \(2\) copies of the positive integers that are congruent to \(\pm 1\) modulo \(6\), one copy of the positive integers that are congruent to \(\pm 2\) modulo \(6\), and \(4\) copies of the odd positive multiples of \(3\). Then, for any \(N\ge 1\),
or equivalently,
Proof
Setting \(a=q\), \(b=q^5\), \(c=q^3\), and \(d=q^3\) in (1.3), we have
which can be rewritten, with the help of the Jacobi triple product identity and Euler’s identity, as
After simplification, the above gives,
which is equivalent to
or equivalently,
We complete the proof by equating the coefficients of \(q^N\) from both sides of the above two identities.\(\square \)
Theorem 7.12
(Corollary to Conjecture 3.48 of [13]) Let \(S\) be the set containing \(4\) copies of the positive multiples of \(6\), one copy of the positive integers that are congruent to \(\pm 1\) modulo \(6\), one copy of the positive integers that are congruent to \(\pm 2\) modulo \(6\), \(2\) more copies of the positive integers that are congruent to \(\pm 4\) modulo \(12\), and \(2\) copies of the odd positive multiples of \(3\); let \(T\) be the set containing \(4\) copies of the positive multiples of \(6\), one copy of the positive integers that are congruent to \(\pm 1\) modulo \(6\), one copy of the positive integers that are congruent to \(\pm 4\) modulo \(12\), \(2\) copies of the odd positive multiples of \(3\), and \(3\) copies of the positive integers that are congruent to \(\pm 2\) modulo \(12\). Then, for any \(N\ge 1\),
or equivalently,
Proof
From (7.39) and (7.37), we find that
With the help of the trivial identity \((-q^{\pm 2};q^6)_\infty =(-q^{\pm 4};q^{12})_\infty (-q^{\pm 2};q^{12})_\infty \), the above reduces to
which can be rewritten as
or equivalently,
Equating the coefficients of \(q^N\), we complete the proof. \(\square \)
To conclude this section, for completeness, we state the following theorem which is Corollary to Conjecture 3.53 of [13], and an analytic proof of this theorem has already been given by Baruah and Berndt [3, Theorem 8.1].
Theorem 7.13
(Corollary to Conjecture 3.53 of [13]) Let \(S\) be the set containing one copy of the odd positive integers, one more copy of the odd positive multiples of \(3\), one more of the odd positive multiples of \(5\), and one more of the odd positive multiples of \(15\); let \(T\) be the set containing one copy of the even positive integers, one more copy of the positive multiples of \(6\), one more of the positive multiples of \(10\), and one more of the positive multiples of \(30\). Then, for any \(N\ge 3\),
or equivalently,
8 Some more colored partition identities
In this section, we present some more colored partition identities which are analogous to the partition identities discussed in the previous sections.
Theorem 8.1
Let \(S\) be the set containing \(2\) copies of the even positive integers, \(4\) more copies of the odd positive multiples of \(3\), and \(2\) copies of the positive multiples of \(4\) that are not multiples of \(12\); let \(T\) be the set containing one copy of the odd positive integers, one more copy of the odd positive multiples of \(3\), two copies of the even positive integers, and \(4\) more copies of the odd multiples of \(6\). Then, for any \(N\ge 1\),
Proof
Multiplying (7.15) by \(\varphi (q^3)\) and then adding \(\varphi ^2(q^3)f(q,q^5)\) to both sides, we have
which can be rewritten, with the aid of (7.38) and Lemma 1.5, as
Transforming the above into \(q\)-products and then simplifying, we obtain
which is equivalent to
We complete the proof by equating the coefficients of \(q^{N}\) from both sides of the above. \(\square \)
Theorem 8.2
Let \(S\) be the set containing \(4\) copies of the positive integers that are congruent to \(\pm 1\) modulo \(6\) and \(2\) copies of the even positive integers that are not multiples of \(6\); let \(T\) be the set containing \(2\) copies of the even positive integers, \(2\) copies of the positive multiples of \(12\), two more copies of the positive integers that are congruent to \(\pm 1\) modulo \(6\) and one more copy of the positive integers that are congruent to \(\pm 4\) modulo \(12\). Then, for any \(N\ge 1\),
Proof
With the help of (7.5), we can rewrite (7.18) as
Transcribing the above into \(q\)-products, we find that
which is equivalent to
Now the proffered partition identity is apparent. \(\square \)
The next two theorems easily follow from (7.38) and (7.15), respectively. We omit the proofs.
Theorem 8.3
Let \(S\) be the set containing one copy of the odd positive integers, one copy of the positive odd multiples of \(3\), one copy each of the positive integers, and the positive multiples of \(3\); let \(T\) be the set containing one copy of the positive integers, \(2\) copies of positive integers that are odd multiples of \(6\), one copy of the positive multiples of \(3\), and \(2\) more copies of the positive multiples of \(4\). Then, for any \(N\ge 1\),
Theorem 8.4
Let \(S\) be the set containing one copy of the odd positive integers, one more copy of the positive odd multiples of \(3\), one copy each of the positive integers, and the positive multiples of \(3\); let \(T\) be the set containing one copy of the positive integers, \(2\) copies of the positive integers that are odd multiples of \(2\), one copy of the positive multiples of \(3\), and \(2\) more copies of the positive multiples of \(12\). Then, for any \(N\ge 1\),
Theorem 8.5
Let \(S\) be the set containing \(3\) copies each of the positive integers, the odd positive integers, the positive multiples of \(3\), and the odd positive multiples of \(3\); let \(T\) be the set containing \(6\) copies each of the odd positive multiples of \(2\) and the positive multiples of \(12\) and \(3\) copies each of the positive integers and the positive multiples of \(3\), and let \(U\) be the set containing \(2\) copies each of the positive integers, the positive multiples of \(3\), the odd positive multiples of \(2\), and the positive multiples of \(12\), one copy each of the odd positive integers, and the odd positive multiples of \(3\). Then, for any \(N\ge 1\),
Proof
We recall from [9, p. 198, Entry 45] that
Cubing and then dividing both sides by \(\psi ^3(-q)\psi ^3(-q^3)\), we have
which can be easily transformed, with the aid of Euler’s identity, into
Since the above is equivalent to
we complete the proof by equating the coefficients of \(q^{N}\) from both sides.\(\square \)
Theorem 8.6
Let \(S\) be the set containing \(6\) copies of the odd positive integers that are not multiple of \(5\) and one copy of the even positive integers; \(T\) be the set containing \(4\) copies of the even positive integers and \(9\) copies of the positive multiples of \(10\), and let \(U\) be the set containing \(5\) copies of the positive multiples of \(10\). Then, for any \(N\ge 1\),
Proof
From [8, p. 278], we recall that
Cubing the above, we obtain
Transforming into \(q\)-products, we have
which can further be reduced to
Thus,
Equating the coefficients of \(q^{2N+1}\) from both sides, we easily arrive at the desired partition identity. \(\square \)
Theorem 8.7
Let \(S\) be the set containing one copy of the positive integers that are congruent to \(\pm 1\) modulo \(6\) and \(2\) copies of the positive integers that are odd multiples of \(3\); \(T\) be the set containing \(2\) copies of the positive integers that are multiples of \(6\) and \(2\) more copies of the positive integers that are congruent to \(\pm 2\) modulo \(12\), and let \(U\) be the set containing \(2\) copies of the positive multiples of \(4\) and \(2\) more copies of the odd multiple of \(6\). Then, for any \(N\ge 1\),
Proof
We can easily transform (7.2) into
which also states that
Equating the coefficient of \(q^{N}\) from both sides, we complete the proof.\(\square \)
Theorem 8.8
Let \(S\) be the set containing one copy of the odd positive integers that are not multiples of \(9\) and \(2\) copies of the even positive integers that are not multiples of \(18\); let \(T\) be the set containing \(2\) copies of the even integers and one more copy of the even positive integers that are not multiples of \(6\). Then, for any \(N\ge 1\),
Proof
We recall from [4, Eq. (8.12)] that
Dividing both sides by \(\varphi (-q^2)\psi (q^{18})\), transforming into \(q\)-products, and then simplifying by using Euler’s identity, we deduce that
Thus,
Equating the coefficients of \(q^{2N+1}\) from both sides, we finish the proof. \(\square \)
Theorem 8.9
Let \(S\) be the set containing one copy of the odd positive integers that are not multiples of \(9\), and let \(T\) be the set containing one copy of the even positive integers that are not multiple of \(6\) and \(2\) more copies of the positive integers that are multiples of \(18\). Then, for any \(N\ge 1\),
Proof
From [8, p. 358, Entry 4(i)], we have
Now, replacing \(q\) by \(-q^2\) in (4.10), we have
Employing the above in (8.2), we find that
which can be transformed into
Since the above is equivalent to
we complete the proof by equating the coefficients of \(q^{2N+1}\) from both sides. \(\square \)
Theorem 8.10
Let \(S\) be the set containing \(2\) copies of the odd positive integers that are not multiples of \(5\), and let \(T\) be the set containing one copy of the even positive integers and \(3\) more copies of the positive integers that are multiples of \(10\). Then, for any \(N\ge 1\),
Proof
We recall from [8, p. 276] that
But, from Entries 9(vii) and 10(iv) of [8, p. 258 and p. 262],
Replacing \(q\) by \(q^2\) in the above and employing it in (8.3), we find that
which can be transformed into
The above is equivalent to
and equating the coefficients of \(q^{2N+1}\) from both sides, we finish the proof. \(\square \)
Theorem 8.11
Let \(S\) be the set containing one copy of the positive integers that are not multiples of \(3\), one more copy of the odd positive integers that are not multiples of \(3\), \(2\) more copies of the positive integers, and \(2\) more copies of the odd positive integers; let \(T\) be the set containing one copy of the positive integers that are not multiples of \(3\), one more copy of the even positive integers that are not multiples of \(6\), \(2\) more copies of the positive integers, and \(2\) more copies of the even positive integers. Then, for any \(N\ge 1\),
Proof
From [8, p. 359], we have
Dividing both sides by \(\dfrac{\varphi (-q)\psi (q^3)}{\psi (q)}\) and then transforming into \(q\)-products, we find that
which is clearly
Equating the coefficients of \(q^{N}\) from both sides, we readily arrive at the desired identity. \(\square \)
Theorem 8.12
Let \(S\) be the set containing two copies each of the positive integers, the odd positive integers, the positive multiples of \(3\), and the odd positive multiples of \(3\), and let \(T\) be the set containing two copies each of the positive integers, the even positive integers, the positive multiples of \(3\), and the positive multiples of \(6\). Then, for any \(N\ge 1\),
Proof
We note from [9, p. 198, Entry 45] that
and
Multiplying together, we have
Dividing both sides by \(\psi ^2(-q)\psi ^2(-q^3)\) and simplifying by Euler’s identity, we obtain
which is
Equating the coefficients of \(q^{N}\) from both sides, we finish the proof. \(\square \)
References
Andrews, G.E., Berndt, B.C.: Ramanujan’s Lost Notebooks, Part I. Springer, New York (2005)
Baruah, N.D., Bora, J.: New proofs of Ramanujan’s modular equations of degree 9. Indian J. Math. 47, 99–122 (2005)
Baruah, N.D., Berndt, B.C.: Partition identities and Ramanujan’s modular equations. J. Comb. Theory Ser. A. 114, 1024–1045 (2007)
Baruah, N.D., Bora, J., Saikia, N.: Some new proofs of the modular relations for the Göllnitz–Gordon functions. Ramanujan J. 15, 281–301 (2008)
Baruah, N.D., Nath, K.: Some reaults on 3-cores. Proc. Amer. Math. Soc. Proc. Amer. Math. Soc. 142, 441–448 (2014)
Berndt, B.C., Zhou, R.R.: Identities for partitions with distinct colors, Ann. Comb., to appear
Berndt, B.C., Zhou, R.R.: Proofs of conjectures of Sandon and Zanello on colored partition identities, submitted for publication.
Berndt, B.C.: Ramanujan’s Notebooks, Part III. Springer, New York (1991)
Berndt, B.C.: Ramanujan’s Notebooks, Part IV. Springer, New York (1994)
Berndt, B.C.: Partition-theoretic interpretations of certain modular equations of Schröter, Russell, and Ramanujan. Ann. Comb. 11, 115–125 (2007)
Hirschhorn, M.D., Roselin: On the 2-,3-,4- and 6-Dissections of Ramanujan’s cubic continued fraction and its reciprocal, in Ramanujan Rediscovered, N. D. Baruah et al. (eds.), RMS Lectuire Notes Series, Vol 14, Ramanujan Math. Soc. 9–30 (2010).
Sandon, C., Zanello, F.: Warnaar’s bijection and colored partition identities. I. J. Comb. Theory Ser. A 120, 28–38 (2013)
Sandon, C., Zanello, F.: Warnaar’s bijection and colored partition identities, II. Ramanujan J. 33, 83–120 (2014)
Yan, Q.: Several identities for certain products of theta functions. Ramanujan J. 19, 79–94 (2009)
Acknowledgments
The authors are extremely grateful to Professor Bruce C. Berndt and the referee for their useful suggestions.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Baruah, N.D., Boruah, B. Colored partition identities conjectured by Sandon and Zanello. Ramanujan J 37, 479–533 (2015). https://doi.org/10.1007/s11139-014-9567-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11139-014-9567-6