We sketch the construction of a bijection between the partitions of n with parts congruent to 1 or 4 (mod 5) and the partitions of n with parts differing by at least 2. This bijection is obtained by a cut-and-paste procedure that starts with a partition in one class and ends with a partition in the other class. The whole construction is a combination of a bijection discovered quite early by Schur and two bijections of our own. A basic principle concerning pairs of involutions provides the key for connecting all these bijections. It appears that our methods lead to an algorithm for constructing bijections for other identities of Rogers-Ramanujan type such as the Gordon identities.
展开▼
