Five Guidelines for Partition Analysis with Applications to Lecture Hall-type Theorems
Sylvie Corteel, Sunyoung Lee, Carla Savage
Abstract
Five simple guidelines are proposed to compute the generating function for the nonnegative integer solutions of a system of linear inequalities. In contrast to other approaches, the emphasis is on deriving recurrences. We show how to use the guidelines strategically to solve some nontrivial enumeration problems in the theory of partitions and compositions. This includes a strikingly different approach to lecture hall-type theorems, with new q-series identities arising in the process. For completeness, we prove that the guidelines suffice to find the generating function for any system of homogeneous linear inequalities with integer coefficients. The guidelines can be viewed as a simplification of MacMahon's partition analysis with ideas from matrix techiniques, Elliott reduction, and ``adding a slice''.
Create a lesson
Related papers
Graded Ehrhart theory for hypersimplices
Nathaniel Libman, Weston Miller
Closing the gap and settling the problem of queens on an n× n board, each attacking at most one other
Kristina Ago, Bojan Bašić, Radojka Ciganović
Leading term strandings for webs
Michael Bo, Madelyn Burns, Junyang Chen et al.
Refutation of the Non-Cancelling-Intersections Conjecture
Hermann Wilhelm
Asymptotic Bounds for Online Ramsey Numbers of Stars versus Long Paths and Cycles
Sam Beilis, Israel R. Curbelo, Elizabeth R. Koizumi
The Erdos--Gallai bound for consecutive even cycle lengths
Yaobin Chen, Hong Liu, Xia Wang et al.