Results 1  10
of
569,761
Finite RogersRamanujan Type Identities
 R13: 1–122
, 2003
"... Polynomial generalizations of all 130 of the identities in Slater's list of identities of the RogersRamanujan type are presented. Furthermore, duality relationships among many of the identities are derived. Some of the these polynomial identities were previously known but many are new. The ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
Polynomial generalizations of all 130 of the identities in Slater's list of identities of the RogersRamanujan type are presented. Furthermore, duality relationships among many of the identities are derived. Some of the these polynomial identities were previously known but many are new
RRtools  a Maple package for aiding the discovery and proof of finite RogersRamanujan type identities
, 2003
"... ..."
RogersRamanujan and the . . .
, 2003
"... In 1961, Baker, Gammel and Wills conjectured that for functions f meromorphic in the unit ball, a subsequence of its diagonal Padé approximants converges uniformly in compact subsets of the ball omitting poles of f. There is also apparently a cruder version of the conjecture due to Padé himself, goi ..."
Abstract
 Add to MetaCart
, going back to the early twentieth century. We show here that for carefully chosen q on the unit circle, the RogersRamanujan continued fraction 1 + qz 1 + q2z 1 + q3z 1 provides a counterexample to the conjecture. We also highlight some other interesting phenomena displayed by this fraction.
The RogersRamanujan identities
"... Abstract. The Bailey lemma is a famous tool to prove RogersRamanujan type identities. We use shifted versions of the Bailey lemma to derive mversions of multisum RogersRamanujan type identities. We also apply this method to the WellPoised Bailey lemma and obtain a new extension of the RogersRam ..."
Abstract
 Add to MetaCart
Abstract. The Bailey lemma is a famous tool to prove RogersRamanujan type identities. We use shifted versions of the Bailey lemma to derive mversions of multisum RogersRamanujan type identities. We also apply this method to the WellPoised Bailey lemma and obtain a new extension of the RogersRamanujan
The RogersRamanujan Identities
, 2004
"... A generalized Bailey pair, which contains several special cases considered by Bailey (Proc. London Math. Soc. (2), 50 (1949), 421–435), is derived and used to find a number of new RogersRamanujan type identities. Consideration of associated qdifference equations points to a connection with a mild ..."
Abstract
 Add to MetaCart
A generalized Bailey pair, which contains several special cases considered by Bailey (Proc. London Math. Soc. (2), 50 (1949), 421–435), is derived and used to find a number of new RogersRamanujan type identities. Consideration of associated qdifference equations points to a connection with a
New Finite RogersRamanujan Identities
, 2009
"... Abstract. We present two general finite extensions for each of the two RogersRamanujan 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 t ..."
Abstract
 Add to MetaCart
Abstract. We present two general finite extensions for each of the two RogersRamanujan 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
Polynomial identities of the Rogers–Ramanujan type
, 1994
"... Presented are polynomial identities which imply generalizations of Euler and Rogers–Ramanujan identities. Both sides of the identities can be interpreted as generating functions of certain restricted partitions. We prove the identities by establishing a graphical onetoone correspondence between th ..."
Abstract

Cited by 23 (1 self)
 Add to MetaCart
Presented are polynomial identities which imply generalizations of Euler and Rogers–Ramanujan identities. Both sides of the identities can be interpreted as generating functions of certain restricted partitions. We prove the identities by establishing a graphical onetoone correspondence between
RogersRamanujan computer searches
 J. Symbolic Comput
"... We describe three computer searches (in PARI/GP, Maple, and Mathematica, respectively) which led to the discovery of a number of identities of RogersRamanujan type and identities of false theta functions. Key words: Bailey pairs; False theta functions; RogersRamanujan identities; qseries; qWZ ce ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We describe three computer searches (in PARI/GP, Maple, and Mathematica, respectively) which led to the discovery of a number of identities of RogersRamanujan type and identities of false theta functions. Key words: Bailey pairs; False theta functions; RogersRamanujan identities; qseries; q
The RogersRamanujan recursion and intertwining
 Progress in Mathematics 112, Birkhäuser
, 1993
"... operators ..."
Results 1  10
of
569,761