A combinatorial proof of the Rogers--Ramanujan and Schur identities
From MaRDI portal
Publication:2500615
DOI10.1016/j.jcta.2005.09.007zbMath1094.05003arXivmath/0411072MaRDI QIDQ2500615
Publication date: 17 August 2006
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0411072
05A19: Combinatorial identities, bijective combinatorics
05A17: Combinatorial aspects of partitions of integers
Related Items
Geometry and complexity of O'Hara's algorithm, Bilateral Bailey lemma and Rogers-Ramanujan identities, A bijective proof of a limiting case of Watson's \(_8\phi_7\) transformation formula, Distribution of the full rank in residue classes for odd moduli, Overpartitions, lattice paths, and Rogers-Ramanujan identities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partition bijections, a survey
- An easy proof of the Rogers-Ramanujan identities
- Extension of the partition sieve
- A Rogers-Ramanujan bijection
- A short Rogers-Ramanujan bijection
- Partially ordered sets and the Rogers-Ramanujan identities
- Generalization of Dyson's rank and non-Rogers-Ramanujan partitions
- Generalized Rogers-Ramanujan bijections
- Some observations on Dyson's new symmetries of partitions
- Variants of the Rogers-Ramanujan identities
- On Fine's partition theorems, Dyson, Andrews, and missed opportunities
- Bijecting Euler's Partitions-Recurrence
- Partitions and Durfee Dissection
- An Enumerative Proof of An Identity of Jacobi
- Shorter Notes: A Simple Proof of Jacobi's Triple Product Identity
- A new symmetry of partitions
- Sieves in the Theory of Partitions