![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_open_medium.gif)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_restricted_medium.gif)
The Bailey Lattice
Subscribe/Renew Journal
The Rogers-Ramanujan identities [5; ch. 7] are given analytically by the following formulae: (|q|<1)
1+∑qn2/(1-q)(1-q2)...(1-qn) (1.1)
=∑1/(1-q5n+1)(1-q5n+2)2
1+∑qn2+n/(1-q)(1-q2)...(1-qn) (1.2)
=∑1/(1-q5n+2)(1-q5n+3)
These are equivalent respectively to the following combinatorial identities:
The number of partitions of n into parts with difference at least 2 equals the number of partitions of n into parts congruent to ±1, modulo 5.
1+∑qn2/(1-q)(1-q2)...(1-qn) (1.1)
=∑1/(1-q5n+1)(1-q5n+2)2
1+∑qn2+n/(1-q)(1-q2)...(1-qn) (1.2)
=∑1/(1-q5n+2)(1-q5n+3)
These are equivalent respectively to the following combinatorial identities:
The number of partitions of n into parts with difference at least 2 equals the number of partitions of n into parts congruent to ±1, modulo 5.
Subscription
Login to verify subscription
User
Font Size
Information
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 205
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 0