Some Rogers-Ramanujan type partition theorems
Analogous to the celebrated Rogers-Ramanujan partition theorems, we obtain four partition theorems wherein the minimal difference for 'about the first half' of the parts of a partition (arranged in non-increasing order of magnitude) is 2. For example, we prove that the number of partitions of n, such that the minimal difference of the 'first half of the summands' (that is, first \([(t+1)/2]\) summands in a partition into t summands) of any partition is 2, equals the number of partitions n into summands congruent to \(\pm 1,\pm 2,\pm 5,\pm 6,\pm 8,\pm 9\) (mod 20)
- Rogers-Ramanujan identities for n-color partitions
- Rook and Wilf equivalence of integer partitions
- On 3-way combinatorial identities
- On \(q\)-series and split lattice paths
- Combinatorial interpretation of a generalized basic series
- Partition Theorems Related to Some Identities of Rogers and Watson
- scientific article; zbMATH DE number 1139713 (Why is no real title available?)
- New partition theoretic interpretations of Rogers-Ramanujan identities
- Further Theorems of the Rogers-Ramanujan Type Theorems*
- Basic series identities and combinatorics
- scientific article; zbMATH DE number 5043116 (Why is no real title available?)
- Further Rogers-Ramanujan type identities for modified lattice paths
- On a generalized 6-way combinatorial identity
- Generalized combinatorial identities for split (n+t)-color partitions
- Combinatorial interpretations of q-identities containing negative exponent of q
This page was built for publication: Some Rogers-Ramanujan type partition theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1064335)
