Abstract
An algorithmic method of producing q-series identities from any given power series is discussed. This recursive technique is then used to give new proofs of several classical q-identities of Gauss and Rogers.
Original language | English (US) |
---|---|
Pages (from-to) | 34-43 |
Number of pages | 10 |
Journal | Algorithmica (New York) |
Volume | 29 |
Issue number | 1-2 |
DOIs | |
State | Published - 2001 |
All Science Journal Classification (ASJC) codes
- General Computer Science
- Computer Science Applications
- Applied Mathematics