New Finite Rogers-Ramanujan Identities
classification
🧮 math.CO
keywords
formulabaileyfiniteidentitiesrogers-ramanujanalgorithmderiveddirectly
read the original abstract
We present two general finite extensions for each of the two Rogers-Ramanujan identities. Of these one can be derived directly from Watson's transformation formula by specialization or through Bailey's method, the second similar formula can be proved either by using the first formula and the q-Gosper algorithm, or through the so-called Bailey lattice.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.