The Bailey Lattice
Jump To References Section
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.
Abstract
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.
Downloads
Download data is not yet available.
Metrics
Metrics Loading ...
Downloads
Published
1987-06-01
How to Cite
Agarwal, A. K., Andrews, G. E., & Bressoud, D. M. (1987). The Bailey Lattice. The Journal of the Indian Mathematical Society, 51(1-2), 57–73. Retrieved from https://informaticsjournals.co.in/index.php/jims/article/view/22020
Issue
Section
Articles
License
Copyright (c) 1987 A. K. Agarwal, G. E. Andrews, D. M. Bressoud
This work is licensed under a Creative Commons Attribution 4.0 International License.