Abstract
In his paper providing an easy proof of the Rogers–Ramanujan identities, D. Bressoud extended his work to multiple series identities. Intrinsic in his works are polynomials with diverse applications to several aspects of \(q\)-series. This paper provides an initial exploration of these polynomials.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
In [9], Bressoud provides a stunningly elementary proof of the celebrated Rogers–Ramanujan identities [2, Chapter 7]:
and
where
and
In fact, the Rogers–Ramanujan identities are the cases \(k=2\), \(i=1,2\) of the following general identity [1]:
Note that it is unnecessary to require that the \(s_j\)’s are nonincreasing because \(\tfrac{1}{(q)_M}=0\) if \(M<0\) by the final expression in (1.3).
Now in Bressoud’s paper [9], after providing his elegant, easy proof, he provides a generalization.
Bressoud’s Theorem. Given positive integers \(k\) and \(N\), we have that
where
Bressoud notes that the case \(k=2\) is the instance from which the Rogers–Ramanujan identities follow, and he points out that the case \(x=-1\) provides a finite version of (1.5) when \(i=k\). Indeed, when \(i=k\), then (1.5) follows with \(x=-1\) and \(N\rightarrow \infty ;\) all that is necessary is to invoke Jacobi’s triple product [2, p. 22, Corollary 2.9].
If we explore (1.6) a little further, something quite surprising is in store. Namely, setting \(x=-q^{k-i}\) and letting \(N\rightarrow \infty \), we find (see Theorems 2 and 3 in Sect. 4)
where
Now the series in (1.8) is identical with the series in (1.5) when \(i=k\) and \(i=k-1\), because \(B_0(z)=1\) and \(B_1(z) = z\). However, while the right-hand sides of (1.5) and (1.8) are identical for \(1\le i\le k\), the left-hand sides differ for \(i< k-1\).
In light of the fact that (1.8) is a special case of (1.5), we shall call the \(B_n(z,q)\) Bressoud polynomials. We shall, in Sect. 2, introduce three further polynomial sequences closely related to \(B_n(z,q)\) and derive some of their basic properties.
In Sect. 3, we put the Bressoud polynomials into the theory of Bailey pairs and Bailey chains. This will be applied in Sects. 5 and 6.
In Sect. 4, we shall reconsider Bressoud’s Theorem from the viewpoint of Bailey chains and derive related results.
Section 5 will look at applications of Bressoud polynomials to Rogers–Ramanujan type identities, and Sect. 6 will consider their relationship to the mock theta functions.
The last two sections provide a discussion of open questions connected with the Bressoud polynomials.
2 Recurrences: the four families of Bressoud polynomials
In addition to the \(B_n(z,q)\) defined by (1.9), we shall also consider
and
The following theorem is fundamental to each application of the Bressoud polynomials:
Theorem 1
If we define for \(n<0\)
and
then for \(n\ge 3\),
Proof
We shall prove (2.7) and (2.9). Recurrence (2.6) follows from (2.7) by (2.1), and (2.8) follows from (2.9) by (2.3).
First we note that
So if we compare coefficients of \((z)_j\) on each side of (2.7), we see that we need to prove
where
Now multiplying both sides of (2.11) by \((q)_{2j}(q)_{n-j}/(q)_{n+j-3}\) reduces the expression to an easily verified polynomial identity.
Similarly if we compare coefficients of \((z)_j\) on each side of (2.9), we see that we need to prove
where
Finally, multiplying both sides of (2.13) by \((q)_{2j+1}(q)_{n-j}/(q)_{n+j-2}\) reduces this expression to an easily verified polynomials identity. \(\square \)
3 Bressoud polynomials in Bailey pairs
Let us recall fundamental aspects of the theory of Bailey chains and Bailey pairs [3]. We start with a pair of sequences of rational functions \((\alpha _n,\beta _n)\) defined to be a Bailey pair provided [3, p. 278]
or equivalently
Whenever you have a Bailey pair, the following holds for integers \(K\ge 1\) [3, p. 273, Eq. (3.1)]:
and in particular when \(K=1\),
Now let us consider four Bailey pairs associated with the Bressoud polynomials. We begin with \(B_n(z,q)\):
Hence with
we see that
is a Bailey pair for \(a=q\).
By exactly the same reasoning, with
we see that
is a Bailey pair for \(a=q\).
Similarly,
we see that
is a Bailey pair for \(a=q^2\).
Finally,
we see that
is a Bailey pair for \(a=q^2\).
4 Bressoud polynomials and the generalized Rogers–Ramanujan series
The object of this section is first to show how Bressoud’s theorem relates to the generalized Rogers–Ramanujan series [1] via Bailey chains, and second to provide a companion result in which the \(D_n(z)\) appears.
Theorem 2
For \(1\le i\le k\),
Remark
This result may also be derived from Bressoud’s original proof of Bressoud’s Theorem. Our goal here is to put the proof into the Bailey chain scenario.
Proof
The \(q\)-binomial theorem [1, p. 36, Eq. (3.3.6)] asserts that
and this result may be rewritten as
Thus, \((\alpha _n,\beta _n)\) is a Bailey pair for \(a=1\), where
and
We now insert this pair into (3.3) with \(a=1\) and \(K=k\):
Now set \(x=q^{k-i}\). The left-hand side of (4.6) becomes
which is the third expression in (4.1), and is thus equal to the first expression in (4.1) by (1.5).
On the right-hand side of (4.6), the inner sum on \(s_k\) becomes
and this confirms that the resulting right-hand side of (4.6) equals the expression in (4.7) and the theorem is proved. \(\square \)
Theorem 3
For \(1\le i \le k\),
Proof
The \(q\)-binomial theorem [1, p. 36, Eq. (3.3.6)] asserts that
and the result may be rewritten as
Thus, \((\overline{\alpha }_n, \overline{\beta }_n)\) is a Bailey pair for \(a=q\), where
and
We now insert this pair into (3.3) with \(a=q\) and \(K=k\) (and we multiply both sides by \(\tfrac{1}{(1-q)}\) ):
Now set \(x=q^{i-1}\). The left-hand side of (4.13) becomes
which is the third expression in (4.8), and is thus equal to the first expression in (4.8) by (1.5).
On the right-hand side of (4.13), the inner sum on \(s_k\) becomes
This confirms that the resulting right-hand side of (4.13) equals the expression in (4.14), and the theorem is proved. \(\square \)
To close this section, we note that the first two expressions in Theorem 3 are identical at \(i=1\) because \(D_0(x)=1\).
5 Rogers–Ramanujan–Slater identities
In this short section, we note that eight identities from [11] are direct corollaries of the results in Sect. 2.
Theorem 4
Proof
We only need to prove (5.1)–(5.4) in light of the fact that (5.5)–(5.8) follow by replacing \(q\) by \(\tfrac{1}{q}\).
As for (5.1)–(5.4), these follow directly by mathematical induction using the recurrences in Theorem 1. For example, by (2.6)
and one verifies directly that the right-hand side of (5.1) satisfies the same recurrence.
Equations (5.2)–(5.4) follow in the same manner. \(\square \)
Seven of these eight identities imply identities listed in Slater’s compendium [11]. In each case, one combines one of the above with the corresponding Bailey pair from Sect. 3 and inserts the result in (3.4). Our (5.1) implies Eq. (83) of [11].
The first entry in (5.9) implies Eq. (32) of [11], and the second entry in (5.9) implies Eq. (19) of [11].
The missing case (which turns out to be a linear combination of two of Slater’s identities) can be written out in full to illustrate the method.
Corollary 5
Proof
Substituting (5.6) into (3.7), we see that \(\left( \alpha _n,\beta _n\right) \) is a Bailey pair for \(a=q\), with
Inserting this pair into (3.4) with \(a=q\), we find
and if we apply Jacobi’s triple product to the two series on the left-hand side, we obtain the desired result. \(\square \)
Turning to Slater’s list, we find that the two infinite products in Corollary 5 correspond to Eqs. (51) and (59) of [11]. Not surprisingly, Slater’s identities imply that the left-hand side of (5.11) is
6 Mock theta functions
It should be noted that the Bailey pair (3.8) was suggested in [5] and studied extensively in [6]. Thus, it is natural that it will arise here among the five instances we shall exhibit that yield the Hecke-type expansions involving indefinite quadratic forms. The cases we have chosen illustrate how often Bressoud polynomials arise in this context. We emphasize that this is only a sample.
Theorem 6
Proof
As in Sect. 5, these results are easily deduced from the recurrences in Theorem 1. As an example, we treat (6.5). It is immediate by inspection that (6.5) is valid for \(n=0,1,2.\) Now let \(\Delta _n\) denote the right-hand side of (6.5). Clearly
while
so
and the relevant recurrence is established. \(\square \)
We may immediately use these results in the Bailey pairs in Sect. 3, and thus obtain the following identities of mock theta or false theta type:
Theorem 7
Proof
In each of the six identities, we take the corresponding evaluation of the Bressoud polynomial in Theorem 6 and then apply it to the corresponding Bailey pair and the Bailey Lemma from Sect. 3.
We should remark that (6.9) is a small variation of the seventh-order mock theta function identity in [5, p. 132, Eq. (7.23)]. Also the last line of (6.10) is due to L. J. Rogers [10, Sect. 9]. \(\square \)
7 Bressoud’s theorem and the generalized Rogers–Ramanujan series
The object of this section is to reconsider the left-hand sides of (1.5) and (1.8).
Theorem 8
For \(1\le i\le k\),
Proof
The above assertion follows immediately from the fact that the right-hand sides of (1.5) and (1.8) are identical. \(\square \)
The object here is to consider whether (7.1) can be proved directly without using either (1.5) or (1.8).
The cases \(i=k\) and \(i=k-1\) are, in fact, tautologies because \(B_0(z,q) =1\) and \(B_1(z,q) =z\).
We go through the \(i=k-2\) case step by step because it illustrates the general case.
For simplicity, we write
Then
because
The simplification applied in the \(i=k-2\) case can be made applicable to the general problem of reducing the left-hand side of (7.1) to the right-hand side.
Lemma 9
Let
Then
Proof
We note that
Hence
\(\square \)
I believe that successive applications of Lemma 9 to the left-hand side of (7.1) will yield the right-hand side of (7.1) just as we did in the case \(i=k-2\) with effectively one application of Lemma 9.
In particular, let us define
Then successive application of Lemma 9 reveals that
and for \(j>2\)
Conjecture 1
We have already shown that this is true for \(j=0,1,2\). The assertion has been verified for \(0\le j\le 10\).
8 Conclusion
There are many questions yet to be examined in connection with the topics explored in this paper. The fact that \(B_n(z,q)\) (actually a normalized version) played a central role in the recent study of the seventh-order mock theta functions [3] suggests that the other three Bressoud polynomials might well reveal interesting results from a similar study.
The work in Sect. 7 is effectively dual to the work of Berkovich and Paule [7, 8]. In their work, they were able to represent
as linear combinations of the series given in (1.5). In section 8, we examine when various linear combinations are identical. Presumably, identical combinations could be identified by means of Lemma 9.
Finally, the fact that the Bressoud polynomials have such diverse applications as those considered here suggests that they merit further study in their own right.
References
Andrews, G.E.: An analytic generalization of the Rogers–Ramanujan identities for odd moduli. Proc. Natl. Acad. Sci. USA 71, 4082–4085 (1974)
Andrews, G.E.: The Theory of Partitions. Addison-Wesley, Providence (1976) (Reissued: Cambridge University Press, Cambridge, 1985)
Andrews, G.E.: Multiple series Rogers–Ramanujan type identities. Pac. J. Math. 114, 267–283 (1984)
Andrews, G.E.: q-Series: Their Development and Application in Analysis, Number Theory, Combinatorics, Physics and Computer Algebra. C.B.M.S. Regional Conference Series in Mathematics, vol. 66. American Mathematical Society, Providence (1986)
Andrews, G.E.: The fifth and seventh order mock theta functions. Trans. Am. Math. Soc. 293, 113–134 (1986)
Andrews, G.E.: Bailey pairs with free parameters, mock theta functions and tubular partitions (to appear) (2014)
Berkovich, A., Paule, P.: Variants of the Andrews-Gordon identities. Ramanujan J. 5, 391–404 (2001)
Berkovich, A., Paule, P.: Lattice paths, \(q\)-multinomials and two variants of the Andrews-Gordon identities. Ramanujan J. 5, 409–425 (2001)
Bressoud, D.: An easy proof of the Rogers–Ramanujan identities. J. Number Theory 16, 235–241 (1983)
Rogers, L.J.: On two theorems of combinatory analysis, and some allied identities. Proc. Lond. Math. Soc. 16(2), 315–336 (1917)
Slater, L.J.: Further identities of the Rogers–Ramanujan type. Proc. Lond. Math. Soc. 54(2), 147–167 (1952)
Author information
Authors and Affiliations
Corresponding author
Additional information
In memory of a wonderful mathematician, my friend Marvin Knopp
This study was partially supported by National Security Agency Grant: H98230-12-1-0205.
Rights and permissions
About this article
Cite this article
Andrews, G.E. Bressoud polynomials, Rogers–Ramanujan type identities, and applications. Ramanujan J 41, 287–304 (2016). https://doi.org/10.1007/s11139-014-9661-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11139-014-9661-9