1. Introduction
Throughout the paper, we use the customary notation
and
The well-known Rogers-Ramanujan functions [
1,
2,
3] are defined for
by
and
In his lost notebook [
4], Ramanujan recorded forty beautiful modular relations involving the Rogers-Ramanujan functions without proof. The forty identities were first brought before the mathematical world by B. J. Birch [
5]. Many of these identities have been established by L. J. Rogers [
6], G. N. Watson [
7], D. Bressoud [
8,
9] and A. J. F. Biagioli [
10]. Recently, B. C. Berndt
et al. [
11] offered proofs of 35 of the 40 identities. Most likely, these proofs might have been given by Ramanujan himself. A number of mathematicians tried to find new identities for the Rogers-Ramanujan functions similar to those that have been found by Ramanujan [
4], including Berndt and H. Yesilyurt [
12], S. Robins [
13] and C. Gugg [
14].
Two beautiful analogues to the Rogers-Ramanujan functions are the Göllnitz-Gordon functions, which are defined as
and
Identities (
1.3) and (
1.4) can be found in L. J. Slater’s list [
15]. S.-S. Huang [
16] has established a number of modular relations for the Göllnitz-Gordon functions. S.-L. Chen and Huang [
17] have derived some new modular relations for the Göllnitz-Gordon functions. N. D. Baruah, J. Bora and N. Saikia [
18] offered new proofs of many of these identities by using Schröter’s formulas and some theta-function identities found in Ramanujan’s notebooks, as well as establishing some new relations. Gugg [
14] found new proofs of modular relations, which involve only
and
. E. X. W. Xia and X. M. Yao [
19] offered new proofs of some modular relations established by Huang [
16] and Chen and Huang [
17]. They also established some new relations that involve only Göllnitz-Gordon functions.
H. Hahn [
20,
21] defined the septic analogues of the Rogers-Ramanujan functions as
and
Identities (
1.5), (
1.6) and (
1.7) are due to Rogers [
22]. Later, Slater [
15] offered different proofs of these identities. Hahn [
20,
21] discovered and established several modular relations involving only
and
, as well as relations that are connected with the Rogers-Ramanujan and Göllnitz-Gordon functions.
Baruah and Bora [
23] considered the following nonic analogues of the Rogers-Ramanujan functions:
and
Identities (
1.8), (
1.9) and (
1.10) are due to W. N. Bailey [
24]. Baruah and Bora [
23] established several modular relations involving
and
. They also established some modular identities involving quotients of these functions, as well as relations that are connected with the Rogers-Ramanujan and Göllnitz-Gordon functions.
C. Adiga, K. R. Vasuki and N. Bhaskar [
25] established several modular relations for the following cubic functions:
and
The identities (
1.11) and (
1.12) can be found in [
26].
Vasuki, G. Sharat and K. R. Rajanna [
27], studied two different cubic functions defined by
and
The identities (
1.13) and (
1.14) are due to G. E. Andrews [
26] and Slater [
15], respectively. Vasuki, Sharat and Rajanna [
27] derived some modular relations involving
and
.
Vasuki and P. S. Guruprasad [
28] considered the following Rogers-Ramanujan type functions
and
of order twelve and established modular relations involving them:
and
The latter equalities in (
1.15) and (
1.16) are due to Slater [
15].
Adiga, Vasuki and B. R. Srivatsa Kumar [
29] established modular relations involving the functions
and
defined by
and
Baruah and Bora [
30] considered the following two functions, which are analogous to the Rogers-Ramanujan functions:
and
where the later equalities are also due to Slater [
15]. Baruah and Bora established many of modular relations involving some combinations of
and
, as well as relations that are connected with the Rogers-Ramanujan functions, Göllnitz-Gordon functions, septic analogues and with nonic analogues functions.
Recently, the authors [
31], established a large class of modular relations for the functions defined by
and
which are analogous to Rogers-Ramanujan functions. The identities (
1.21) and (
1.22) are due to Rogers [
22]. In
Section 3 of this paper, we establish modular relations connecting
and
with
and
. In
Section 4, we establish modular relations connecting
and
with
and
. In
Section 5, we establish modular relations connecting
and
with
and
. In
Section 6, we give partition theoretic interpretations of some of our modular relations.
2. Definitions and Preliminary Results
Ramanujan’s general theta function is defined by
The Jacobi triple product identity [
32, Entry 19] in Ramanujan’s notation is
The function
satisfies the following basic properties [
32]:
and, if
n is an integer,
The three special cases of (
2.1) [
32, Entry 22] are
and
Also, after Ramanujan, it is defined
For convenience, we define
for positive integer
n.
In order to prove our modular relations, we first establish some lemmas.
This lemma is a consequence of (
2.2) and Entry 24 of [
32]. We shall use Lemma 2.1 many times in this paper.
It is easy to verify that
Lemma 2.2. Let and ,
. Here denotes the largest integer less than or equal to x. Then,- (i)
- (ii)
For a proof of Lemma, 2.2 see [
31].
The following lemma is an easy consequence of Entry 29 [
32]:
Identity (
2.17) can be found in [
32] as a corollary of Entry 28.
Lemma 2.5. For any integers and , we haveandwhere . The proof of Lemma 2.5 follows easily by induction.
We use a theorem of R. Blecksmith, J. Brillhart and I. Gerst [
33], which provides a representation for a product of two theta functions as a sum of
m products of a pair of theta functions, under certain conditions. This theorem generalizes formulas of H. Schröter, which can be found in [
32].
Define, for
and
Theorem 2.6. (Blecksmith, Brillhart and Gerst [33]). Let and d denote positive numbers with .
Suppose that there exist positive integers and m such thatLet and define byrespectively, where Then, if R denotes any complete residue system modulo m, The function
satisfies a beautiful addition formula, which we need in proving some identities. For each positive integer
k, let
Then
For the proof of (
2.21), see [
32, Entry 31] . The following two identities follow from (
2.21) by setting
,
and
and
, respectively:
Yesilyurt [
34, Theorem 3.1] gave a generalization of Rogers’s identity, which has been used to prove some of the Ramanujan’s forty identities for the Rogers-Ramanujan functions, as well as new identities for Rogers-Ramanujan functions. To prove some of our results, we use Corollary
found in [
34].
Following Yesilyurt [
34], we define
Let
m be an integer and
and
λ be positive integers, such that
Let
δ and
ε be integers. Further, let
l and
t be real and
x and
y be nonzero complex numbers. Recall that in the general theta functions
are defined by (
2.1) and (
2.24). With the parameters defined this way, we set
Lemma 2.7. [34, Corollary 3.2]. To prove some of our results, we need the following two Schröter’s formulas, which can be found in [
32]. We assume that
μ and
ν are integers, such that
.
Lemma 2.9. If μ is odd, then 3. Identities Connecting and with Rogers-Ramanujan Functions and
In this section, we present some modular relation that are connecting and with Rogers-Ramanujan functions and .
Proof. Putting
and
in (
2.15), we obtain
Dividing (
3.2) throughout by
, employing (
2.10) and (
2.11) and then using the Lemma 2.1, we obtain
Setting
and
in (
2.15) and after simplifications, we obtain
Now, dividing (
3.3) by (
3.4), we deduce
from which we obtain (
3.1). ☐
Theorem 3.2. We have- (i)
- (ii)
Proof. We recall the following identity stated by Ramanujan [
4] and proved by Rogers [
6], Watson [
7] and Berndt
et al. [
11]:
We can write (
3.6) in the form
Now, setting
and
in (
2.18) and (
2.19) and multiplying the resulting equations by
and
, respectively, we obtain
and
Dividing (
3.8) by (
3.9) and then employing (
3.7), we find that
Now, we show that
By (
2.2), we have
Now, using (
3.11) in (
3.10), we obtain
It remains for us to show that
Using (
1.2) (
2.11) and Lemma 2.1, we see that
This completes the proof of (i).
To prove (ii), we need the following identity stated by Ramanujan [
4], the proof of which can be found in [
7] and [
11, Entry 3.3]:
We can write (
3.14) in the form
Now, employing (
3.8) and (
3.9) in (
3.15) and then use (
3.11) to obtain
On employing (
3.13) in (
3.16) and then using Lemma 2.1, we obtain (ii). This completes the proof of the theorem. ☐
Theorem 3.3. We have- (i)
,
- (ii)
Proof. Using (
2.2), we have
Now employing (
2.10) and (
2.11) in the last equality, we obtain
Similarly, we can show that
Now, (i) and (ii) easily follow from (
3.17) and (
3.18). ☐
We prove the following theorem using ideas similar to those of Watson [
7]. In Watson’s method, one expresses the left sides of the identities in terms of theta functions by using (
2.10) and (
2.11). After clearing fractions, we see that the right side can be expressed as a product of two theta functions, say with summations indices
m and
One then tries to find a change of indices of the form
so that the product on the right side decomposes into the requisite sum of two products of theta functions on the left side.
Theorem 3.4. Let and , then Proof. Using (
2.10), (
2.11), (
2.17) and Lemma 2.1, we can write (
3.19) in the form
Setting
and
, respectively, in (
2.16) and then employing the resulting identities in (3.23), we obtain
Thus, it suffices to establish the identity (
3.24). Using (
2.4) and (
2.8), we have
In this representation, we make the change of indices by setting
where
a and
b have values selected from the set
. Then
It follows that values of
a and
b are associated, as in the following table:
a | 0 | ±1 | ±2 |
b | 0 | ±2 | ∓1 |
m | M+2N | M+2N±1 | M+2N |
n | −M+3N | −M+3N±1 | −M+3N∓1 |
When
a assumes the values
and
in succession, it is easy to see that the corresponding values of
are, respectively,
It is evident, from the equations connecting
m and
n with
M and
N that, there is a one-one correspondence between all pairs of integers
and all sets of integers
. From this correspondence, we can write (
3.25) as
Upon using Lemma 2.2 and after some simplifications, we get (
3.24). This completes the proof of (
3.19).
Using (
2.10), (
2.11), (
2.17) and Lemma 2.1, we find that (
3.20) is equivalent to the identity
Setting
and
, respectively, in (
2.16) and then employing the resulting identities in (
3.26), we obtain
Thus, it suffices to prove (
3.27). Using (
2.8), we may write
In this representation, we make the change of indices by setting
where
a and
b have values selected from the set
. Then
It follows easily that
, and so
and
, where
Thus, there is one-to-one correspondence between the set of all pairs of integers
and triples of integers
,
From (
3.28), we find that
Employing (
2.22) and (
2.23) in (
3.29), we obtain (
3.27). The proofs of (
3.21) and (
3.22) follow similarly. ☐
Theorem 3.5. We haveandwhere and are as defined in theorem 3.4.
Proof. Using (
1.1), we have
Identity (
3.32) can be written in the form
Similarly, we have
Replacing
q by
in (
3.33) and (
3.34) and then employing the resulting identities in (
3.6) and (
3.14), we get (
3.30) and (
3.31), respectively. ☐
Proof. Using (
2.10), (
2.11), (
2.17) and Lemma 2.1, we find that (
3.35) is equivalent to the identity
Putting
and
, respectively, in (
2.16) and then using the resulting identities in (3.37), we obtain
Thus (
3.38) is equivalent to (
3.35). To prove (
3.38), we employ Theorem 2.6 with the parameters
,
,
,
,
,
,
and
and then using Lemma 2.2, we get
Changing
q to
, in (
2.22) and (
2.23), and then employing the resulting identities in (
3.39), we obtain (
3.38). The proof of (
3.36) follows similarly. ☐
Proof. Using (
2.10), (
2.11), (
2.17) and Lemma 2.1, one can write (
3.40) in the form
Employing (
2.16) with
and
, respectively, in (
3.45), we find that
Thus, (
3.40) is equivalent to (
3.46). However, identity (
3.46) can be verified easily using (
2.26) with setting
and
and then changing
to
q in the resulting identity. The proofs of (
3.41) and (
3.42) follow similarly using (
2.26) with setting
,
and
, respectively. In a similar way, identities (
3.43) and (
3.44) can be established using (
2.27) with setting
,
and
, respectively. ☐
Observation 3.8. In most of the above identities, the functions ,
,
and occur in combinationsor when one or both of and are replaced by and , respectively, in either (3.47) or (3.48). 6. Applications to the Theory of Partitions
Some of our modular relations yield theorems in the theory of partitions. In this section, we present partition theoretic interpretations of the Theorem 3.2 and the identities (
3.1), (
3.21) and (
3.35).
Definition 6.1 A positive integer n has k colors if there are k copies of n available 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 two colors, say
r (red) and
g (green), then all the colored partitions of 3 are 3,
,
,
,
,
and
. It is easy to see that
is the generating function for the number of partitions of
n, where all the parts are congruent to
and have
k colors. For simplicity, we define
where
r and
s are positive integers with
.
In this section, we shall use the following alternative definitions of
and
:
and
Theorem 6.2. Let denote the number of partitions of n into parts congruent to ,
,
,
, with ,
and having two colors. Let denote the number of partitions of n into parts congruent to ,
,
,
with ,
and having two colors. Let denote the number of partitions of n into parts congruent to ,
,
,
and with ,
and having two colors. Let denote the number of partitions of n into parts congruent to ,
,
,
and with ,
and having two colors. Then, for any positive integer ,
Proof. Using (
1.1), (
1.2), (
6.1) and (
6.2), it is easy to verify that the identity (
3.1) is equivalent to
Now, rewrite all the products on both sides of (
6.3) subject to the common base
to obtain
The four quotients of (
6.4) represent the generating functions for
,
,
and
, respectively. Hence, (
6.4) is equivalent to
where we set
. Equating coefficients of
(
) on both sides yields the desired result. ☐
Example 6.3. The following table illustrates the case in Theorem 6.2 | | | |
, , , ,
| |
| , ,
|
Theorem 6.4. Let denote the number of partitions of n into parts congruent to ,
,
,
,
and 10
with ,
and 10
having two colors and having three colors. Let denote the number of partitions of n into parts congruent to ,
,
,
,
and 10
with ,
and 10 having two colors and having three colors. Let denote the number of partitions of n into odd parts having two colors. Then, for any positive integer ,
Proof. Using (
2.11), (
2.16), (
2.7), (
1.1), (
1.2) and (
2.2), we find that the Theorem 3.2(i) is equivalent to
Now, rewrite all the products on both sides of (6.5) subject to the common base
to obtain
The three quotients of (
6.6) represent the generating functions for
,
and
, respectively. Hence, (
6.6) is equivalent to
where we set
. Equating coefficients of
(
) on both sides yields the desired result. ☐
Example 6.5. The following table illustrates the case in Theorem 6.4 | | |
, , , , , | 3 | , , , ,
|
Theorem 6.6. Let denote the number of partitions of n into parts congruent to ,
,
,
and 10
with and 10
having two colors. Let denote the number of partitions of n into parts congruent to ,
,
and 10
with and 10
having two colors. Let denote the number of partitions of n into parts congruent to and with having two colors. Then, for any positive integer , we have Proof. In a similar way, as in Theorem 6.4, the Theorem 3.2(ii) is equivalent to
The three quotients of (
6.7) represent the generating functions for
,
and
, respectively. Hence, (
6.7) is equivalent to
where we set
. Equating coefficients of
(
) on both sides yields the desired result. ☐
Example 6.7. The following table illustrates the case of in Theorem 6.6 | | |
, , , ,
| 7
3 + 2 + 2 | 8, 6 + 2, 4 + 4, 4 + 2 + 2, 2 + 2 + 2 + 2 |
Theorem 6.8. Let denote the number of partitions of n into parts congruent to ,
,
,
,
,
,
,
and 20
with having two colors and ,
,
and having three colors. Let denote the number of partitions of n into parts congruent to ,
,
,
,
,
,
,
and 20
with 20
having two colors and ,
,
and having three colors. Let denote the number of partitions of n into parts not congruent to ,
,
,
,
,
and with ,
,
having two colors and 20
having four colors. Let denote the number of partitions n into parts congruent to ,
,
,
,
,
,
,
,
,
,
with ,
,
,
,
,
and having two colors. Then, for any positive integer ,
Proof. Using (
2.11), (
2.16), (
2.7), (
1.1), (
1.2) and (
2.2), we deduce that the identity (
3.21) is equivalent to
Now, rewrite all the products on both sides of (
6.8) subject to the common base
to obtain
The four quotients of (
6.9) represent the generating functions for
,
,
and
, respectively. Hence, (
6.9) is equivalent to
where we set
. Equating coefficients of
(
) on both sides yields the desired result. ☐
Example 6.9. The following table illustrates the case of in Theorem 6.8 | | | |
,
| , , , , ,
| 7, ,
|
|
Theorem 6.10. Let denote the number of partitions of n into parts congruent to ,
,
,
,
,
and with ,
and having two colors and having three colors. Let denote the number of partitions of n into parts congruent to ,
,
,
,
,
and with ,
and having two colors and having three colors. Let denote the number of partitions of n into parts congruent to 10
with two colors. Let denote the number of partitions of n into parts congruent to ,
,
,
and 10
with two colors. Then, for any positive integer ,
Proof. Using (
1.1), (
1.2), (
6.1) and (
6.2) and then rewriting all the products subject to the common base
, we find that the identity (
3.35) is equivalent to
The four quotients of (
6.10) represent the generating functions for
,
,
and
, respectively. Hence, (
6.10) is equivalent to
where we set
. Equating coefficients of
(
) on both sides yields the desired result. ☐
Example 6.11. We illustrate Theorem 6.10 in the case of , and we can easily verify that , , and .