arXiv · 1406.3374
Partitions with fixed differences between largest and smallest parts
Abstract
We study the number $p(n,t)$ of partitions of $n$ with difference $t$ between largest and smallest parts. Our main result is an explicit formula for the generating function $P_t(q) := \sum_{n \ge 1} p(n,t) \, q^n$. Somewhat surprisingly, $P_t(q)$ is a rational function for $t>1$; equivalently, $p(n,t)$ is a quasipolynomial in $n$ for fixed $t>1$. Our result generalizes to partitions with an arbitrary number of specified distances.
Explore related subjects
Keep this discovery
George E. Andrews, Matthias Beck, Neville Robbins. 2014-06-12. Partitions with fixed differences between largest and smallest parts. https://arxiv.org/abs/1406.3374
Cite the original work for its findings. Save a collection to share your selection of sources.