New Finite Rogers-Ramanujan Identities
Victor J. W. Guo, Frederic Jouhet, Jiang Zeng
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.
Create a lesson
Related papers
Graded Ehrhart theory for hypersimplices
Nathaniel Libman, Weston Miller
Closing the gap and settling the problem of queens on an n× n board, each attacking at most one other
Kristina Ago, Bojan Bašić, Radojka Ciganović
Leading term strandings for webs
Michael Bo, Madelyn Burns, Junyang Chen et al.
Refutation of the Non-Cancelling-Intersections Conjecture
Hermann Wilhelm
Asymptotic Bounds for Online Ramsey Numbers of Stars versus Long Paths and Cycles
Sam Beilis, Israel R. Curbelo, Elizabeth R. Koizumi
The Erdos--Gallai bound for consecutive even cycle lengths
Yaobin Chen, Hong Liu, Xia Wang et al.