The Combinatorics of MacMahon’s Partial Fractions
2019
MacMahon showed that the generating function for partitions into at most $k$ parts can be decomposed into a partial fractions-type sum indexed by the partitions of $k$. In this present work, a generalization of MacMahon's result is given, which in turn provides a full combinatorial explanation.
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
11
References
4
Citations
NaN
KQI