Abstract
MacMahon showed that the generating function for partitions into at most k parts can be decomposed into a partial fraction-type sum indexed by the partitions of k. In the present work, a generalization of MacMahon’s result is given, which in turn provides a full combinatorial explanation.
| Original language | English |
|---|---|
| Pages (from-to) | 1073-1086 |
| Number of pages | 14 |
| Journal | Annals of Combinatorics |
| Volume | 23 |
| Issue number | 3-4 |
| DOIs | |
| State | Published - Nov 1 2019 |
Scopus Subject Areas
- Discrete Mathematics and Combinatorics
Keywords
- Compositions
- Partition function
- Partitions
- Symmetric group
Fingerprint
Dive into the research topics of 'The Combinatorics of MacMahon’s Partial Fractions'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver