An Algorithmic Approach to Rogers-Ramanujan Type Identities

Research output: Contribution to conferencePresentation

Abstract

108 years after their initial discovery by L. J. Rogers, the Rogers-Ramanujan identities continue to stimulate research in numerous areas of the mathematical sciences including the theory of partitions, Lie algebras, statistical physics, and symbolic computation.

I will discuss a method for producing polynomial generalizations of Rogers-Ramanujan type identities via an algorithmic method using nonhomogeneous q-difference equations. Next, I will discuss some of the implications of this method for algorithmic proof theory and statistical mechanics.
Original languageAmerican English
StatePublished - Nov 22 2002
EventUniversity of South Florida Department of Mathematics Colloquium - Tampa, FL
Duration: Nov 22 2002 → …

Conference

ConferenceUniversity of South Florida Department of Mathematics Colloquium
Period11/22/02 → …

Keywords

  • Algorithmic
  • Rogers-Ramanujan Type Identities

DC Disciplines

  • Mathematics

Fingerprint

Dive into the research topics of 'An Algorithmic Approach to Rogers-Ramanujan Type Identities'. Together they form a unique fingerprint.

Cite this