Abstract
Ramanujan recorded Eisenstein series identities of level 5 of weight 2. The objective of this article is to prove these identities by classical method and also we find some new Eisenstein series identities for level 7. Finally we make use of these results to obtain convolution sums of divisor functions. We will also be introducing certain restricted color partition functions which helps us to represent the convolution sums in a much elegant form than the existing ones.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
The smallest and the last chapter of the organized portion of the Ramanujan’s notebooks is dedicated to Eisenstein series and deducing identities of the form \(P_1-nP_n = \) linear combinations of ratios of theta functions. Ramanujan documented identities of level 3, 5, 7, 9, 11, 17, 19, 23, 25, 31 and 35. The Chapter 21 of the Ramanujan’s notebooks Part III edited by Berndt focuses on proofs of the equalities connecting a certain linear combinations of Eisenstein series with theta functions. Cooper and Toh [9] have proved results for \(n=5,7\). Cooper [7] proved certain Eisenstein series identities for level 5 using k-parametrization. Cooper and Ye [11] proved some Eisenstein series identities for level 7 using the theory of modular forms. In Sect. 4 of this article, we establish certain new Eisenstein series identities for level 5 of the above type by making use of Bailey’s formula which can be deduced from his very-well known \(_6\psi _6\) summation formula:
where f(a, b) and \(f_n\) are as defined below in Sect. 2.
Let \({\mathbb {N}}\) denote the set of all natural numbers. As usual let
For convenience, we set \(\sigma _1(n)=\sigma (n)\). We define the convolution sum \(W_k(n)\) by
where \(a,b,k,n \in {\mathbb {N}}\). Note that \(W_{(1,k)} (n) =W_{(k,1)} (n) = W_k(n)\). The sum \(W_k(n)\) have been evaluated for some \(k'\text {s} \le 64\), for all \(n \in {\mathbb {N}}\). For a brief history and development of the this field, one may refer [17]. Most of the convolution sums are evaluated using arithmetic or analytic methods and some use theory of quasi-modular forms. The convolution sums for level 5, 7, 10 and 14 have a constant term. In Sect. 5 of this paper, our object is to deduce convolution sums for level 5, 7, 10 and 14 entirely in terms of divisor functions and partition functions by using the identities obtained in the previous sections and to prove certain fascinating congruence properties of these partition functions.
2 Preliminary results
As usual for any complex number a and q with \( |q|<1\), we define
and the q shifted factorial
where n is any integer.
On page 197 of his second notebook [19], Ramanujan defined his general theta-function as
Further Ramanujan also defined three special cases of f(a, b) namely,
and
He also defined
For \(q=e^{2\pi i\tau }\) , \(Im(\tau )>0\), the classical Dedekind eta function \(\eta (\tau )\) is defined by
For any positive integer n, throughout this article we set
Further for convenience, we set
The following u (resp. U), v (resp. V) and w (resp. W) relations are the important tools to prove our main results:
and
Ramanujan recorded (2.2), (2.3) and (2.5) in the unorganized portion of his second notebook [19, p. 325 and 327] and popularly known as the P–Q theta function identities. He recorded (2.4) and (2.6) in the modular equation form [19, p. 237 and 240]. The identities (2.2), (2.3) and (2.5) are proved by Berndt and Zhang [4] using Ramanujan’s modular equations. Proof of (2.4) and (2.6) (modular equation form) can be found in [3, Entry 13(xiv) and Entry 19(ix)]. The identity (2.7) is due to Vasuki and Sreeramamurthy [25]. Recently Bhargava et al. [5] have found a very simple proof of (2.2), (2.3) and (2.4) using Ramanujan’s \(_1\psi _1\) summation formula. Elementary proofs of (2.5), (2.6) and (2.7) by using only theta functions results of Ramanujan can be found in [26].
We make use of the famous Ramanujan’s \(_1\psi _1\) Summation formula:
We also determine some Eisenstein series identities for level 7 in addition to that of Cooper and Ye [11] by using (2.5)–(2.7).
Ramanujan’s Eisenstein series P(q) and Q(q) are defined by
Theorem 2.1
For any positive integer n, we have
and
For a proof of (2.9) and (2.10), see [2, p. 318] and a proof (2.11), see [12] and [22, Eq (30)], [20, p. 142].
Theorem 2.2
We have
Berndt [3, p. 139] proved the above theorem by using the modular equation identities. Cooper [8] too proved using the elliptic funtion identities.
From the above theorem, we have
and
For any complex number a and for each positive integer n, let
and
The Gauss ordinary hypergeometric series is defined by
A modular equation of degree n is a relation between \(\alpha \) and \(\beta \) that is induced by the equation
In such relation, we say \(\beta \) has \(n^{th}\) degree in \(\alpha \). We also define the multiplier m by
where
The following theorem of Ramanujan’s play a central role in transforming a theta function identity into a modular equation and vice-versa.
Theorem 2.3
For \(\displaystyle q=\text {exp}\left( -\pi \frac{K'}{K}\right) \) and \(\displaystyle z=K\), then
and
where
3 Quintic and septic identities for \(Q_n\)’s
In this section, we deduce \(Q_n\)’s for \(n=1,2,5,7,10\) and 14 in terms of \(f_n\) for \(n=1,2,5,7,10\) and 14.
Theorem 3.1
If \(T=q^{\frac{3}{4}}f_1f_2f_5f_{10}\), then
and
Proof
The identity (2.4) is equivalent to
From the above identity, one may deduce the following:
and
From (2.3), (2.4) and the definition of x, we find that
Substituting the identity obtained by subtracting 3 times of (3.7) from 5 times of (3.6) in (2.12) and then using (3.10) in the resulting identity, we obtain (3.1).
Substituting the identity obtained by adding 5 times of (3.6) with 3 times of (3.7) in (2.13) and then employing (3.10) in the resulting identity, we obtain (3.2).
Replacing q by \(q^5\) in (2.12) and then employing the identity obtained by subtracting 3 times of (3.9) from 5 times of (3.8) in the resulting identity and then using (3.9), we obtain (3.3).
Replacing q by \(q^5\) in (2.13) and then employing the identity obtained by adding 5 times of (3.8) and 3 times of (3.9) in the resulting identity and then using (3.10), we obtain (3.4). \(\square \)
Theorem 3.2
If \(S=qf_1f_2f_7f_{14}\), then
and
Proof
From (2.6), we find that
From (2.5) and the definition of y, we have
From the above two equation, we have
and
The identity (2.6) is equivalent to
From the above identity, one may deduce the following identities:
and
Using (3.16) and the identity obtained by subtracting 3 times of (3.20) from 5 times of (3.19) in (2.12) and then using (3.15) to eliminate \(\sqrt{\left( y^3-6y+5 \right) \left( y^3-6y+9 \right) } \) and then employing the definition of y in the resulting identity, we obtain (3.11).
Using (3.16) and the identity obtained by adding 5 times of (3.19) and 3 times of (3.20) in (2.13) and then using (3.15) and the definition of y in the resulting identity, we obtain (3.12).
Replacing q by \(q^7\) in (2.12) and using (3.17) and the identity obtained by subtracting 3 times of (3.22) from 5 times of (3.21) in the resulting identity and then using (3.15) and the definition of y, we obtain (3.13).
Replacing q by \(q^7\) in (2.13) and using (3.17) and the identity obtained by adding 5 times of (3.21) and 3 times of (3.22) in the resulting identity and then using (3.15) and the definition of y, we obtain (3.14). \(\square \)
4 Eisenstein series of level 10 and 14
This section acts as the bridge between Sects. 3 and 5. In this section, we determine certain new identities relating Eisenstein series of level 5 and 10. We also find certain Eisenstein series identities for level 7 and 14.
Theorem 4.1
We have
Proof
Setting \(a=q\), \(b=-1\) in (1.1), we find that
Setting \(a=q^3\), \(b=-1\) in (1.1), we find that
Adding the above two identity, we have
Setting \(a=q^5\), \(b=-1\) in (1.1), we find that
Using the above in (4.1),we have
From [3, p. 258], we have
From [3, p. 251], we have
Using the above in (4.3) and then using the resulting identity in (4.2), we find that
Expanding each of the summands into geometric series, interchanging the order of summation, summing the inner geometric series and then using definition of \(P_n\), we obtain the required result. \(\square \)
Theorem 4.2
Proof
Setting \(a=-q^2\), \(b=-q^5\) in (1.1), we find that
Setting \(a=-q^4\), \(b=-q^5\) in (1.1), we find that
Adding the above two identity, we have
Setting \(a=-1\), \(b=-q^5\) in (1.1), we find that
Using the above in (4.5), we have
From [3, Entry 29, p. 45], we find that
From [3, p. 263], we have
Squaring (4.7) and using the resulting indentity along with (4.4) and the above identity in (4.6), we find that
Expanding each of the summands into geometric series, interchanging the order of summation, summing the inner geometric series and then using definition of \(P_n\), we obtain the required result. \(\square \)
Lemma 4.3
We have
Proof
Using \(\psi (q)=\displaystyle \frac{f_2^2}{f_1}\) and the defintion of u and w from (2.1), we have
Using (2.2), (2.3) and (2.4), we have the required result. \(\square \)
Theorem 4.4
We have
and
Proof
Let \(\beta \) have degree 5 over \(\alpha \), \(z_1\), \(z_5\) be as defined in (2.15) and m be the multiplier for degree 5 defined by (2.14). From (2.16), (2.18), (2.23), (2.24) and (2.25), we have
From [3, p. 280, Entry 13(iv)] and [3, p. 284, Eqs. (13.3) and (13.5)], we have
Using the above in (4.11), we find that
Similarly tranforming the square of the right hand side of (4.9) by using (2.19), (2.22) and (2.23) into modular equations, we have
From [3, p. 286, Eqs. (13.12), (13.13) and (13.14)], we have
Using the above in (4.14) and then taking the positive square root, we have
Guided by Lemma 4.3, we have considered the positive root. The identity (4.9) follows from (4.13) and (4.16). The proof of (4.10) is similar to that of (4.9). \(\square \)
Corollary 4.5
We have
and
Proof
Using (4.8), (4.9) and the definition of v in Theorem 4.1, we deduce (4.17). Changing q to \(q^{\frac{1}{2}}\) in Theorem 4.2 and in (4.10) and then using (4.8) and the definition of v, we deduce (4.18). \(\square \)
Remark
From the above corollary, Entry 4(i) of Chapter 21 of Ramanujan’s second notebook [19] follows.
Theorem 4.6
We have
and
where T is as defined in the Theorem 3.1.
Proof
From (4.17) and (4.18), we have
From [8, p. 196, Theorem 3.26], we have
From [3, Entry 25(vii), p. 40], we have
Using the above identity in (4.22), we have
From (3.6), we deduce that
Employing the above identity in (4.23) and then using (3.10) to eliminate \(\sqrt{x^2-20}\) and \(\sqrt{x^2-4}\) in the resulting identity, we deduce that
From (3.8), we deduce that
Changing q to \(q^5\) in (4.23) and then employing (4.25) and (3.10) in the resulting identity, we find that
Consider
Using (4.21), (4.24), (4.26) in the right hand side of the above identity and then employing (2.2) and (2.4), we obtain (4.19). Now consider
Employing (4.21), (4.24), (4.26) in the right hand side of the above identity and then employing (2.2) and (2.4), we obtain (4.20). \(\square \)
Theorem 4.7
Let S be as defined in Theorem 3.2. Then
and
Proof
From [26, p. 54, Theorem 3.2.9], we have
and
From the above two equations, we have
From [26, p. 57, Theorem 3.3.1], we have
Employing the above equation in (4.29), we have
The identity (2.5) is equivalent to
From the above identity, we have
and
Changing q to \(q^2\) in (4.30) and then using (4.32) and the definition of y in the resulting identity, we obtain
Using (3.16) and (3.19), we find that
Using the above identity in (4.23) and then using (3.15) and the definition of y in the resulting identity, we obtain
Using (3.17) and (3.21), we find that
Changing q to \(q^7\) in (4.23) and then using the (4.35) and (3.15) and the definition of y in the resulting identity, we obtain
Consider
Using (4.33), (4.34) and (4.36) in the above equation, we obtain (4.27). Now consider
Using (4.33), (4.34) and (4.36) in the above equation, we obtain (4.28). \(\square \)
5 Applications to convolution sums of divisor function
In this section, we use some of the results of preceeding sections to evaluate convolution sums. We recall the definition of color partition and also we introduce certain restricted color partition functions which will be used in the evaluation of the convolution sums to avoid the coefficient functions of some infinite series existing in the convolution sums of [9, 10, 15, 16, 18, 24]. For convenience, we adopt the standard notation
and define
Definition 5.1
[13] A positive integer n has l colors if there are l copies of n available colors and all of them are viewed as distinct objects. Partitions of a positive integer into parts with colors are called “colored partitions”.
For example, if 1 is allowed to have 2 colors, then all the colored partitions of 2 are 2, \(1_r + 1_r\), \(1_g + 1_g\) and \(1_r + 1_g\). Where we use the indices r (red) and g (grey) to distinguish the two colors of 1. Also
is the generating function for the number of partitions of n where all the parts are congruent to u (mod v) and have k colors.
We now introduce the following seven restricted color partition funtions for lateral use in this section:
Definition 5.2
Let \(p_{(d,e)}(n)\) (resp. \(p_{(d,o)}(n)\)) denote the number of distinct partitions of n with even (resp. odd) number of parts and parts congruent to 0 (mod 5) with 8 colors, parts not congruent to 0 (mod 5) with 4 colors each.
From the above definition, it is clear that
where \(P^*(n)=p_{(d,e)}(n)-p_{(d,o)}(n)\), with \( P^*(0)=1\). Let \(r-\)red, \(b-\)blue, \(y-\)yellow, \(g-\)green, O-range, p-pink, br-brown and bl-black. Then we have
n | \(p_{(d,e)}(n)\) | \(p_{(d,o )}(n)\) | \(P^*(n)\) |
---|---|---|---|
1 | 0 | 4 (1r, 1b, 1y, 1g) | \(-4\) |
2 | 6 \(\begin{array}{l} (1r+1b, 1r+1y, 1r+1g, 1b+1y, \\ 1b+1g, 1y+1g) \\ \end{array}\) | 4 (2r, 2b, 2y, 2g) | 2 |
3 | \(\begin{array}{l} 16 (1r+2r, 1r+2b, 1r+2y, 1r+2g,\\ 1b+2r, 1b+2b, 1b+2y, 1b+2g, \\ 1y+2r, 1y+2b, 1y+2y, 1y+2g,\\ 1g+2r, 1g+2b, 1g+2y, 1g+2g)\\ \end{array}\) | \(\begin{array}{l} 8 (1r+1b+1y, 1r+1b+1g, 1r+1y+1g,\\ 1b+1y+1g, 3r, 3b, 3y, 3g) \end{array}\) | 8 |
4 | \(\begin{array}{l} 23 (2r+2b, 2r+2y, 2r+2g, 2b+2y,\\ 2b+2g, 2y+2g, 1r+3r, 1r+3b, \\ 1r+3y, 1r+3g, 1b+3r, 1b+3b, \\ 1b+3y, 1b+3g, 1y+3r, 1y+3b, \\ 1y+3y, 1y+3g,1g+2r, 1g+2b, \\ 1g+2y, 1g+2g, 1r+1b+1y+1g) \\ \end{array}\) | \(\begin{array}{l} 28 (4r, 4b, 4y, 4g, 1r+1b+2r, 1r+1b+2b \\ 1r+1b+2y, 1r+1b+2g, 1r+1y+2r, \\ 1r+1y+2b, 1r+1y+2y, 1r+1y+2g, \\ 1r+1g+2r, 1r+1g+2b, 1r+1g+2y, \\ 1r+1g+2g, 1b+1y+2r, 1b+1y+2b, \\ 1b+1y+2y, 1b+1y+2g, 1b+1g+2r, \\ 1b+1g+2b, 1b+1g+2y, 1b+1g+2g, \\ 1b+1g+2r, 1y+1g+2b, 1y+1g+2y, \\ 1b+1g+2g) \\ \end{array}\) | \(-5\) |
Similarly for \(n=5\), one can easily find that \(p_{(d,e)}(n)=48\) and \(p_{(d,o)}(n)=56\).
Definition 5.3
Let \(m_{(d,e)}(n)\) (resp. \(m_{(d,o)}(n)\)) denote the number of partitions of n such that
-
i.
parts which are congruent to \(\pm 1\), \(\pm 3\) (mod 10) have 1 color.
-
ii.
parts which are not congruent to 0, \(\pm 1\), \(\pm 3\) (mod 10) are distinct and have 4 colors each and parts congruent to 0 (mod 10) are distinct and have 8 colors.
-
iii.
number of parts which are not congruent to \(\pm 1\), \(\pm 3\) (mod 10) being even (resp. odd).
Using the above definition, we find that
where \(M(n)=m_{(d,e)}(n)-m_{(d,o)}(n)\), with \(M(0)=1\). Let \(r-\)red, \(b-\)blue, \(y-\)yellow, \(g-\)green, O-range, p-pink, br-brown and bl-black. Then we have
n | \(m_{(d,e)}(n)\) | \(m_{(d,o)}(n)\) | M(n) |
---|---|---|---|
1 | 1 (1r) | 0 | 1 |
2 | 1 (\(1r+1r\)) | 4 (2r, 2b, 2y, 2g) | \(-3\) |
3 | 2 (\(1r+1r+1r\), 3r) | 4 (\(1r+2r\), \(1r+2b\), \(1r+2y\), \(1r+2g\)) | \(-2\) |
4 | \(\begin{array}{l} 8 (2r+2b, 2r+2y, 2r+2g, 2b+2y, \\ 2b+2g, 2y+2g, 1r+1r+1r+1r, 1r+3r) \\ \end{array}\) | \(\begin{array}{l} 8 (4r, 4b, 4y, 4g, 1r+1r+2r, \\ 1r+1r+2b, 1r+1r+2y, \\ 1r+1r+2g) \\ \end{array}\) | 0 |
Similarly for \(n=5\), one can easily find that \(m_{(d,e)}(n)=8\) and \(m_{(d,o)}(n)=16\).
One can also find the values of coefficients involved in following definitions by using the same technique used in the above two tables.
Definition 5.4
Let \(t_{(d,e)}(n)\) (resp. \(t_{(d,o)}(n)\)) denote the number of distinct partitions of n with even (resp. odd) number of parts and parts congruent to 0 (mod 10) with 8 colors, parts congruent to \(\pm 2\), \(\pm 4\), 5 (mod 10) with 4 colors each, parts congruent to \(\pm 1\), \(\pm 3\) (mod 10) with 5 colors each.
The above definition yields
where \(T^*(n)=t_{(d,e)}(n)-t_{(d,o)}(n)\), with \(T^*(0)=1\).
Definition 5.5
Let \(l_{(d,e)}(n)\) (resp. \(l_{(d,o)}(n)\)) denote the number of distinct partitions of n with even (resp. odd) number of parts and parts congruent to 0 (mod 14) with 8 colors, parts congruent to \(\pm 2\), \(\pm 4\), \(\pm 6\) (mod 14) with 4 colors each, parts congruent to \(\pm 1\), \(\pm 3\), \(\pm 5\) (mod 14) with 5 colors each, parts congruent to 7 (mod 14) with 10 colors.
From the above definition, one can easily see that
where, \(L(n)=l_{(d,e)}(n)-l_{(d,o)}(n)\), with \(L(0)=1\).
Definition 5.6
Let \(k_{(d,e)}(n)\) (resp. \(k_{(d,o)}(n)\)) denote the number of distinct partitions of n with even (resp. odd) number of parts and parts congruent to 0 (mod 14) with 8 colors, parts congruent to \(\pm 2\), \(\pm 4\), \(\pm 6\), 7 (mod 14) with 4 colors each, parts congruent to \(\pm 1\), \(\pm 3\), \(\pm 5\) (mod 14) with 2 colors each.
From the above definition, we see that
where \(K(n)=k_{(d,e)}(n)-k_{(d,o)}(n)\), with \(K(0)=1\).
Definition 5.7
Let \(a_{(d,e)}(n)\) (resp. \(a_{(d,o)}(n)\)) denote the number of partitions of n such that
-
i.
parts which are congruent to \(\pm 1\), \(\pm 3\), \(\pm 5\) (mod 14) have 2 colors.
-
ii.
parts which are not congruent to 0, \(\pm 1\), \(\pm 3\), \(\pm 5\) (mod 14) are distinct and have 4 colors each and parts congruent to 0 (mod 14) are distinct and have 8 colors.
-
iii.
number of parts which are not congruent to \(\pm 1\), \(\pm 3\), \(\pm 5\) (mod 14) being even (resp. odd).
From the above definition, we have
where \(A(n)=a_{(d,e)}(n)-a_{(d,o)}(n)\), with \(A(0)=1\).
Definition 5.8
Let \(b_{(d,e)}(n)\) (resp. \(b_{(d,o)}(n)\)) denote the number of distinct partitions of n with even (resp. odd) number of parts and parts congruent to 0 (mod 14) with 8 colors, parts congruent to \(\pm 2\), \(\pm 4\), \(\pm 6\), 7 (mod 14) with 4 colors each, parts congruent to \(\pm 1\), \(\pm 3\), \(\pm 5\) (mod 14) with 6 colors each.
From the above definition, one may find that
where \(B(n)=b_{(d,e)}(n)-b_{(d,o)}(n)\), with \(B(0)=1\).
Note: We set \(P^*(n)=M(n)=T^*(n)=L(n)=K(n)=A(n)=B(n)=0 \quad \forall \quad n \notin {\mathbb {N}} \cup \left\{ 0\right\} \).
As stated in the beginning of this section, the identity (5.8) and (5.17) are same as that deduced by M. Lemire and K. S. Williams [15] and also Cooper and Toh [9] have deduced (5.8) and (5.17), apart from the constant term, which we have represented using partition function. Lemire and Williams have deduced these identities by finding the direct relations between Eisenstein series of weight 2 and 4 from existing identities found in [21]. Cooper and Toh have deduced by employing modular equations and differentiation. Royer [24] too have deduced (5.8), (5.10), (5.17) and (5.19) by the method based on quasimodular forms. Similarly the identity (5.9) is same as that deduced by Cooper and Ye [10] by quasi-modular. Ntienjem [16] have deduced (5.18) and (5.19) by employing modular groups and modular forms. Ramakrishnan, Sahu and Singh [18] have also deduced (5.17), (5.18) and (5.19). Our method is very elementary as we used certain Eisenstein series identities of weight 2 (also deduced by elementary approach) to find the required convolution sums.
Theorem 5.9
We have
and
Proof
Adding 4 times of (4.17) to (4.18), we have
Squaring the above identity on both sides and then using (2.2), (2.3) and (2.4), we obtain
where
Adding 8 times of (3.1) and 5 times of (3.3) and then using (2.3), we have
Replacing q by \(q^{5}\) in (2.9) and in (2.11) and substituting the resulting identities in the left hand side of (5.11) and using (2.9) and (2.11), we obtain
Using (5.12) in the above to eliminate \(X_1\) and then using (2.10) and (5.1) and then equating the coefficients of \(q^n\) on both sides of the resulting identity, we obtain (5.8).
Subtracting 3 times of (4.20) from (4.19), we have
Squaring the above on both sides and then using (2.2) and (2.4), we obtain
where
From Theorem 3.1, (2.2) and (2.4), we have
Replacing q by \(q^2\) in (2.9) and in (2.11) and q by \(q^5\) in (2.9) and in (2.11) and substituting the resulting identities in the left hand side of (5.13), we find that
Using (5.14) in the above to eliminate \(X_2\) and then using (2.10), (5.2) and (5.3) and then equating the coefficients of \(q^n\) on both sides of the resulting identity, we obtain (5.9).
Subtracting (4.20) from 3 times of (4.19), we have
Squaring the above on both sides and then using (2.2) and (2.4), we obtain
where
From Theorem 3.1, (2.2) and (2.4), we find that
Replacing q by \(q^{10}\) in (2.9) and in (2.11) and substituting the resulting identities in the left hand side of (5.4) and using (2.9) and (2.11), we obtain
Using (5.16) in the above to eliminate \(X_3\) and then using (2.10), (5.2) and (5.3) and then equating the coefficients of \(q^n\) on both sides of the resulting identity, we obtain (5.10). \(\square \)
Theorem 5.10
We have
and
Proof
Using (4.31) and the definition of y in (4.30), we obtain
Squaring the above identity on both sides, we obtain
where
Adding (3.11) and 49 times of (3.13), we have
Replacing q by \(q^{7}\) in (2.9) and in (2.11) and substituting the resulting identities in the left hand side of (5.20) and using (2.9) and (2.11), we obtain
Using (5.21) in the above to eliminate \(X_4\) and then using (2.10), (5.4) and (5.5) and then equating the coefficients of \(q^n\) on both sides of the resulting identity, we obtain (5.17).
Subtracting 3 times of (4.28) from (4.27), we have
Squaring the above on both sides and then using (2.6), we obtain
where
From Theorem 3.2 and (2.6), we have
Replacing q by \(q^2\) in (2.9) and in (2.11) and q by \(q^7\) in (2.9) and in (2.11) and substituting the resulting identities in the left hand side of (5.22), we find that
Using (5.23) in the above to eliminate \(X_5\) and then using (2.10), (5.5), (5.6) and (5.7) and then equating the coefficients of \(q^n\) on both sides of the resulting identity, we obtain (5.18).
Subtracting (4.28) from 3 times of (4.27), we have
Squaring the above on both sides and then using (2.6), we obtain
where
From Theorem 3.2 and (2.6), we have
Replacing q by \(q^{14}\) in (2.9) and in (2.11) and substituting the resulting identities in the left hand side of (5.24) and using (2.9) and (2.11), we obtain
Using (5.25) in the above to eliminate \(X_6\) and then using (2.10), (5.5), (5.6) and (5.7) and then equating the coefficients of \(q^n\) on both sides of the resulting identity, we obtain (5.19). \(\square \)
Let \({\mathbb {Z}}\) denote the set of integers and \(x_i \in {\mathbb {Z}}\) for \(1 \le i \le 8\). For \(a,b,n \in {\mathbb {N}}\), let \(T_{(a,b)}(n)\) be the number of representations of n by the form
The identity and proof of the following theorem is similar to that of Ramakrishnan, Sahu and Singh [18], apart from the constant term, which we have represented using partition functions.
Theorem 5.11
If \(n\in {\mathbb {N}}\), then
Proof
For \(k \in {\mathbb {N}}_0= {\mathbb {N}} \displaystyle \cup \left\{ 0\right\} \), let
Clearly \(s_{(a,4)}(0)=1\). From [6, Example 3, p.6], we have
(See [1, Entry 18.2.15, p.405], [3, Entry 5, p.467] for further details.) From the above identity, we have
We have
Using (5.26) in the above, we obtain
Using the convolution sum \(W_2(n)\) from [14, Theorem 2] and employing (5.18) and (5.19) in the above, we complete the proof. \(\square \)
Ramanujan observed certain curious congruence properties of p(n)(number of unrestricted partitions of n) as soon as he noticed the table calculated by Major MacMahon, of the values of p(n), for all values of n from 1 to 200. He [23] found quite simple proofs of the following congruences of p(n):
Following the above many mathematicians proved interesting congruence properties of certain color and restricted color partition functions. We too have discovered some intriguing congruence properties of the seven restricted color partition functions introduced in this section. Theorems 5.12-5.18 seem to be new.
Theorem 5.12
Let n be any non negative integer and let \(P^*(n)\) be as in (5.1). Then
and
Proof
From (5.1), we have
From [3, p. 40, Entry 25, (v) and (vi)], we have
Changing q to \(q^5\) in the above and substituting the resulting identity along with (5.35) in the right hand side of (5.34), we find that
Extracting the terms involving \(q^{2n+1}\) from both sides of the above, we have
Dividing both sides of the above by q and then replacing \(q^2\) by q, we deduce (5.32). For any positive integer k, it is easy to see that
Using the above in (5.36), we have
Extracting the terms involving \(q^{4n+1}\) from both sides of the above congruence, dividing both sides by q and then replacing \(q^4\) by q, we deduce (5.27). Similarly by extracting the terms involving \(q^{4n+2}\) and \(q^{4n+3}\) respectively from both sides of the above congruence, dividing both sides by \(q^2\) and \(q^3\) respectively and then replacing \(q^4\) by q, we deduce (5.28) and (5.29) respectively. Ramanujan [20] recorded the following identity:
Using the above in (5.34), we find that
Extracting the terms involving \(q^{5n+1}\) from both sides of the above and then dividing by q and replacing \(q^5\) by q in the resulting identity, we obtain (5.30). Extracting the terms involving \(q^{5n+2}\) from both sides of the above and then dividing by \(q^2\) and replacing \(q^5\) by q in the resulting identity, we obtain (5.31). Extracting the terms involving \(q^{5n+4}\) from both sides of the above and then dividing by \(q^4\) and replacing \(q^5\) by q in the resulting identity, we obtain (5.33). \(\square \)
Ramanujan [20, p. 212, Identity (14)] also recorded the following identity:
From [3, p. 262, Entry 10, (i) and (ii)], we have
and
From [3, p. 303, Entry 17, (iii) and (iv)], we have
and
From [3, p. 40, Entry 25, (i) and (ii)], we have
Using appropriate identities from (5.35), (5.38) and from (5.39) - (5.44), one may easily prove the following theorems:
Theorem 5.13
For all integer \(n \ge 0\), we have
where M(n) is as in (5.2).
Theorem 5.14
Let n be any non negative integer and let \(T^*(n)\) be as in (5.3). Then
and
Theorem 5.15
For all integer \(n \ge 0\), we have
where L(n) is as in (5.4).
Theorem 5.16
Let n be any non negative integer and let K(n) be as in (5.5). Then
and
Theorem 5.17
For all integer \(n \ge 0\), we have
where A(n) is as in (5.6).
Theorem 5.18
Let n be any non negative integer and let B(n) be as in (5.7). Then
References
Andrews, G.E.; Berndt, B.C.: Ramanujan’s Lost Notebook, Part I. Springer, New York (2005)
Berndt, B.C.: Ramanujan’s Notebooks: Part II. Springer, New York (1989)
Berndt, B.C.: Ramanujan’s Notebooks: Part III. Springer, New York (1991)
Berndt, B.C.; Zhang, L.C.: Ramanujan’s identities for eta-functions. Math. Ann. 292(3), 561–573 (1992)
Bhargava, S.; Vasuki, K.R.; Rajanna, K.R.: On some Ramanujan identities for the ratios of eta-functions. Ukrain. Math. J. 66(8), 1131–1151 (2015) (Reprint of Ukraïn. Mat. Zh. 66(8), 1011–1028 (2014))
Chan, H.H.; Cooper, S.: Powers of theta functions. Pac. J. Math. 235(1), 1–14 (2008)
Cooper, S.: On Ramanujan’s function \(k(q)=r(q)r^2(q^2)\). Ramanujan J. 20(3), 311–328 (2009)
Cooper, S.: Ramanujan’s Theta Functions. Springer, Berlin (2017)
Cooper, S.; Toh, P.C.: Quintic and septic Eisenstein series. Ramanujan J. 19(2), 163–181 (2009)
Cooper, S.; Ye, D.: Evaluation of the convolution sums \(\sum _{l+20m=n}\sigma (l)\sigma (m)\), \(\sum _{4l+5m=n}\sigma (l)\sigma (m)\) and \(\sum _{2l+5m=n}\sigma (l)\sigma (m)\). Int. J. Number Theory 10(6), 1385–1394 (2014)
Cooper, S.; Ye, D.: Level 14 and 15 analogues of Ramanujan’s elliptic functions to alternative bases. Trans. Am. Math. Soc. 368(11), 7883–7910 (2016)
Glaisher, J.W.L.: Mathematical Papers, pp. 1883–1885. W. Metcalfe and Son, Cambridge (1885)
Huang, S.-S.: On modular relations for the Göllnitz-Gordon functions with applications to partitions. J. Number Theory 68(2), 178–216 (1998)
Huard, J.G.; Ou, Z.M.; Spearman, B.K.; Williams, K.S.: Elementary evaluation of certain convolution sums involving divisor functions. In: Number Theory for the Millennium, II (Urbana, IL, 2000), pp. 229–274. A K Peters, Natick (2002)
Lemire, M.; Williams, K.S.: Evaluation of two convolution sums involving the sum of divisors function. Bull. Austral. Math. Soc. 73(1), 107–115 (2006)
Ntienjem, E.: Evaluation of the convolution sums \(\sum _{\alpha l+\beta m=n}\sigma (l)\sigma (m)\) where \((\alpha , \beta )\) is in \(\{(1,14), (2,7), (1,26), (2,13), (1,28), (4,7), (1,30), (2,15), (3,10), (5,6) \}\). Master’s Thesis, School of Mathematics and Statistics, Carleton University (2015)
Pushpa, K.; Vasuki, K.R.: Evaluation of convolution sums \(\sum _{l+km=n} \sigma (l) \sigma (m)\) and \(\sum _{al+bm=n} \sigma (l) \sigma (m)\) for \(k=a \cdot b=21, 33\) and \(35\). Glasgow Math. J. 20, 1–20 (2021)
Ramakrishnan, B., Sahu, B., Singh, A.K.: On the number of representations of certain quadratic forms in 8 variables. In: Automorphic Forms and Related Topics, Volume 732 of Contemporary Mathematics. American Mathematical Society, Providence, pp 215–224 (2019)
Ramanujan, S.: Notebooks (2 Volumes). Tata Institute of Fundamental Research, Bombay (1957)
Ramanujan, S.: Collected Papers. Cambridge University Press, Cambridge (1927).(reprinted by Chelsea, New York, (1962). reprinted by the AMS, Providence, RI, (2000)).
Ramanujan, S.: The Lost Notebook and Other Unpublished Papers. Narosa, New Delhi (1988)
Ramanujan, S.: On certain arithmetical functions. Trans. Camb. Philos. Soc. 22(9), 159–184 (1916)
Ramanujan, S.: Some properties of \(p(n)\), the number of partitions of \(n\) [Proc. Cambridge Philos. Soc. 19 (1919). 207–210]. In: Collected papers of Srinivasa Ramanujan, pages 210–213. AMS Chelsea Publ., Providence, RI (2000)
Royer, E.: Evaluating convolution sums of the divisor function by quasimodular forms. Int. J. Number Theory 3(2), 231–261 (2007)
Vasuki, K.R.; Sreeramamurthy, T.G.: A note on \(P\)-\(Q\) modular equations. Tamsui Oxf. J. Math. Sci. 21(2), 109–120 (2005)
Veeresha, R.G.: A elementary approach to Ramanujan’s modular equations of degree 7 and it’s applications. Doctorial Thesis submitted to University of Mysore, Mysuru, India (2015)
Acknowledgements
We are thankful for the valuable suggestions of the anonymous referee for the improvement of this article. The research of the first author is supported by grant F.No.16-6(DEC, 2018)/2019(NET/CSIR) by the funding agency UGC, New Delhi, INDIA and second author is supported by SERB, Govt. of India (EMR/2016/001064).
Open Access
This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Author information
Authors and Affiliations
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Pushpa, K., Vasuki, K.R. On Eisenstein series, color partition and divisor function. Arab. J. Math. 11, 355–378 (2022). https://doi.org/10.1007/s40065-022-00360-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40065-022-00360-6