The combinatorics of MacMahon's partial fractions
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.