A combinatorial proof of the Rogers-Ramanujan and Schur identities

Abstract

We give a combinatorial proof of the first Rogers-Ramanujan identity by using two symmetries of a new generalization of Dyson’s rank. These symmetries are established by direct bijections. 
DOI: 10.1016/j.jcta.2005.09.007

5 Figures and Tables

Topics

  • Presentations referencing similar topics