Mahonian Partition Identities Via Polyhedral Geometry
Abstract
In a series of papers, George Andrews and various coauthors successfully revitalized seemingly forgotten, powerful machinery based on MacMahon's operator to systematically compute generating functions Σ ∈ P z11...znn for some set P of integer partitions = (1,..., n). Our goal is to geometrically prove and extend many of the Andrews et al theorems, by realizing a given family of partitions as the set of integer lattice points in a certain polyhedron.
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.