Shifted versions of the Bailey and well-poised Bailey lemmas
classification
🧮 math.CO
keywords
baileyidentitieslemmarogers-ramanujanversionsshiftedtypewell-poised
read the original abstract
The Bailey lemma is a famous tool to prove Rogers-Ramanujan type identities. We use shifted versions of the Bailey lemma to derive $m$-versions of multisum Rogers-Ramanujan type identities. We also apply this method to the Well-Poised Bailey lemma and obtain a new extension of the Rogers-Ramanujan identities.
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.