A family of partition identities proved combinatorially (Q1840496)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1563055
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A family of partition identities proved combinatorially |
scientific article; zbMATH DE number 1563055 |
Statements
A family of partition identities proved combinatorially (English)
0 references
30 August 2001
0 references
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.
0 references
partition identities
0 references
Rogers-Ramanujan identities
0 references
number of partitions
0 references
families of partitions
0 references
0.8462518453598022
0 references
0.8365099430084229
0 references
0.826999843120575
0 references
0.8250946998596191
0 references
0.8240261077880859
0 references
