A Rogers-Ramanujan Computer Search

Andrew V. Sills

A Rogers-Ramanujan Computer Search

Mathematical Sciences

Research output: Contribution to conference › Presentation

Abstract

The Rogers-Ramanujan identities and a number of other q-series identities of similar type were discovered by L. J. Rogers in 1894. In the 1940's, W. N. Bailey studied Rogers' paper and discovered the underlying engine (now known as "Bailey's lemma") which made it work. Bailey's student L. J. Slater made extensive use of Bailey's lemma to produce a list of 130 Rogers-Ramanujan type identities. In this talk, I will explain Bailey's lemma, and then describe and demonstrate a simple Maple program, combined with Frank Garvan's qseries package, which rediscovers Slater's list and finds identities apparently missed by Rogers, Bailey, and Slater.

Original language	American English
State	Published - Feb 12 2004
Event	Rutgers Experimental Mathematics Seminar - New Brunswick, NJ Duration: Mar 10 2005 → …

Conference

Conference	Rutgers Experimental Mathematics Seminar
Period	03/10/05 → …

Disciplines

Mathematics

Keywords

Computer Search
Rogers-Ramanujan

Cite this

@conference{a0d4976894204fff9cb613acb30d34f5,

title = "A Rogers-Ramanujan Computer Search",

abstract = " The Rogers-Ramanujan identities and a number of other q-series identities of similar type were discovered by L. J. Rogers in 1894. In the 1940's, W. N. Bailey studied Rogers' paper and discovered the underlying engine (now known as {"}Bailey's lemma{"}) which made it work. Bailey's student L. J. Slater made extensive use of Bailey's lemma to produce a list of 130 Rogers-Ramanujan type identities. In this talk, I will explain Bailey's lemma, and then describe and demonstrate a simple Maple program, combined with Frank Garvan's qseries package, which rediscovers Slater's list and finds identities apparently missed by Rogers, Bailey, and Slater. ",

keywords = "Computer Search, Rogers-Ramanujan",

author = "Sills, {Andrew V.}",

year = "2004",

month = feb,

day = "12",

language = "American English",

note = "Rutgers Experimental Mathematics Seminar ; Conference date: 10-03-2005",

}

TY - CONF

T1 - A Rogers-Ramanujan Computer Search

AU - Sills, Andrew V.

PY - 2004/2/12

Y1 - 2004/2/12

N2 - The Rogers-Ramanujan identities and a number of other q-series identities of similar type were discovered by L. J. Rogers in 1894. In the 1940's, W. N. Bailey studied Rogers' paper and discovered the underlying engine (now known as "Bailey's lemma") which made it work. Bailey's student L. J. Slater made extensive use of Bailey's lemma to produce a list of 130 Rogers-Ramanujan type identities. In this talk, I will explain Bailey's lemma, and then describe and demonstrate a simple Maple program, combined with Frank Garvan's qseries package, which rediscovers Slater's list and finds identities apparently missed by Rogers, Bailey, and Slater.

AB - The Rogers-Ramanujan identities and a number of other q-series identities of similar type were discovered by L. J. Rogers in 1894. In the 1940's, W. N. Bailey studied Rogers' paper and discovered the underlying engine (now known as "Bailey's lemma") which made it work. Bailey's student L. J. Slater made extensive use of Bailey's lemma to produce a list of 130 Rogers-Ramanujan type identities. In this talk, I will explain Bailey's lemma, and then describe and demonstrate a simple Maple program, combined with Frank Garvan's qseries package, which rediscovers Slater's list and finds identities apparently missed by Rogers, Bailey, and Slater.

KW - Computer Search

KW - Rogers-Ramanujan

UR - http://sites.math.rutgers.edu/~bte14/expmath/archive04.html

M3 - Presentation

T2 - Rutgers Experimental Mathematics Seminar

Y2 - 10 March 2005

ER -

A Rogers-Ramanujan Computer Search

Abstract

Conference

Disciplines

Keywords

Other files and links

Fingerprint

Cite this