MIT Combinatorics Seminar
A new combinatorial proof of the RogersRamanujan identities
Cilanne Boulet
(MIT)
Wednesday, October 13, 2004
4:15 pm Room 2338
ABSTRACT

We give a combinatorial proof of the RogersRamanujan identities by using two
symmetries of a new generalization of Dyson's rank. These symmetries are
established by direct bijections. We will also show how to extend this proof
to Andrews' generalization of the RogersRamanujan identities.
This is joint work with Igor Pak.


