Article
Formulæ for the Number of Partitions of n into at Most m Parts (Using the Quazi-Polynomial Ansatz)
Advances in Applied Mathematics
Document Type
Article
Publication Date
5-1-2012
DOI
10.1016/j.aam.2011.12.003
Disciplines
- Education and
- Mathematics
Abstract
The purpose of this short article is to announce, and briefly describe, a Maple package, PARTITIONS, that (inter alia) completely automatically discovers, and then proves, explicit expressions (as sums of quasi-polynomials) for pm(n) for any desired m. We do this to demonstrate the power of “rigorous guessing” as facilitated by the quasi-polynomial ansatz.
Citation Information
Andrew Sills and Doron Zeilberger. "Formulæ for the Number of Partitions of n into at Most m Parts (Using the Quazi-Polynomial Ansatz)" Advances in Applied Mathematics Vol. 48 Iss. 5 (2012) p. 640 - 645 ISSN: 0196-8858 Available at: http://works.bepress.com/andrew_sills/36/
This version of the paper was obtained from arXIV.org. In order for the work to be deposited in arXIV.org, the author must have permission to distribute the work or the work must be available under the Creative Commons Attribution license, Creative Commons Attribution-Noncommercial-ShareAlike license, or Create Commons Public Domain Declaration. The publisher's final edited version of this article is available at Advances in Applied Mathematics.