✦ LIBER ✦

The Rogers–Selberg recursions, the Gordon–Andrews identities and intertwining operators

✍ Scribed by S. Capparelli; J. Lepowsky; A. Milas

Book ID: 106511231
Publisher: Springer US
Year: 2006
Tongue: English
Weight: 343 KB
Volume: 12
Category: Article
ISSN: 1382-4090
DOI: 10.1007/s11139-006-0150-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A partition bijection related to the Rog

A partition bijection related to the Rogers–Selberg identities and Gordon's theorem

✍ Andrew V. Sills 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 172 KB

The Rogers–Ramanujan–Gordon identities,

The Rogers–Ramanujan–Gordon identities, the generalized Göllnitz–Gordon identities, and parity questions

✍ Kim, Sun; Yee, Ae Ja 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 287 KB

Lattice Paths,q-Multinomials and Two Var

Lattice Paths,q-Multinomials and Two Variants of the Andrews-Gordon Identities

✍ Alexander Berkovich; Peter Paule 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 118 KB

Partially ordered sets and the rogers-ra

Partially ordered sets and the rogers-ramanujan identities

✍ George E. Andrews 📂 Article 📅 1975 🏛 Springer 🌐 English ⚖ 614 KB

Partially ordered sets and the rogers-ra

Partially ordered sets and the rogers-ramanujan identities

✍ George E. Andrews 📂 Article 📅 1974 🏛 Springer 🌐 English ⚖ 90 KB

Engel Expansions and the Rogers–Ramanuja

Engel Expansions and the Rogers–Ramanujan Identities

✍ George E. Andrews; Arnold Knopfmacher; John Knopfmacher 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 176 KB

We study the previously developed extension of the Engel expansion to the field of Formal Laurent series. We examine three separate aspects. First we consider the algorithm in relation to the work of Ramanujan. Second we show how the algorithm can be used to prove expansions such as those found by E