Cilanne Boulet, Igor Pak
Published 2004-11-03, updated 2005-09-19Version 2
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.
Comments: 12 pages, 5 figures; incorporated referee suggestions, simplified definition of (k,m)-rank, to appear in JCT(A)
A combinatorial proof of a relationship between maximal $(2k-1,2k+1)$ and $(2k-1,2k,2k+1)$-cores
Towards a Combinatorial proof of Gessel's conjecture on two-sided Gamma positivity: A reduction to simple permutations
Combinatorial proof of an identity of Andrews--Yee
![QR code for arXiv:math/0411072 [math.CO]](http://oss.arxitics.com/images/favicon.svg)