Stabilization of coefficients for partition polynomials
Abstract
We find that a wide variety of families of partition statistics stabilize in a fashion similar to pk(n), the number of partitions of n with k parts, which satisfies pk(n) = pk+1(n + 1), k ≥ n/2. We bound the regions of stabilization, discuss variants on the phenomenon, and give the limiting sequence in many cases as the coefficients of a single-variable generating function. Examples include many statistics that have an Euler product form, partitions with prescribed subsums, and plane overpartitions.
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.