Partitions with fixed differences between largest and smallest parts

From MaRDI portal
Publication:2944779

DOI10.1090/S0002-9939-2015-12591-9zbMATH Open1328.11106arXiv1406.3374OpenAlexW2050820552MaRDI QIDQ2944779FDOQ2944779

Matthias Beck, George E. Andrews, Neville Robbins

Publication date: 8 September 2015

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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 Pt(q):=sumnge1p(n,t),qn. Somewhat surprisingly, Pt(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.


Full work available at URL: https://arxiv.org/abs/1406.3374




Recommendations




Cites Work


Cited In (14)

Uses Software





This page was built for publication: Partitions with fixed differences between largest and smallest parts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2944779)