Abstract
We revisit a classic partition theorem due to MacMahon that relates partitions with all parts repeated at least once and partitions with parts congruent to 2,3,4,6(mod6), together with a generalization by Andrews and two others by Subbarao. Then we develop a unified bijective proof for all four theorems involved, and obtain a natural further generalization as a result.
Original language | English (US) |
---|---|
Journal | Electronic Journal of Combinatorics |
Volume | 21 |
Issue number | 2 |
DOIs | |
State | Published - May 28 2014 |
Externally published | Yes |
Keywords
- Bijection
- Generating function
- Partition
- Residue classes