A family of partition identities proved combinatorially (Q1840496): Difference between revisions

One of the arithmetical interpretations of the two well-known Rogers-Ramanujan identities is ``The number of partitions of \(n\) with parts differing by at least 2 greater than or equal to \(i\) equals the number of partitions of \(n\) in parts \(\equiv\pm i\pmod 5\), \(i= 1,2\).'' The purpose of this paper is to present three infinite families of partitions that, for corresponding parameters, are equinumerous. A couple of other interpretations of the Rogers-Ramanujan identities have also been provided.