Formulæ for the number of partitions of n into at most m parts (using the quasi-polynomial ansatz)

DOI10.1016/J.AAM.2011.12.003MaRDI QIDQ424536zbMATH OpenOpenAlexFDO

Authors Andrew V. Sills, Doron Zeilberger

Publication date 1 June 2012

Published in Advances in Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

integer partitionsMaple package

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81)

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.

Recommendations

• Universal formulas for the number of partitions
• A formula for the partition function that ``counts
• scientific article; zbMATH DE number 1156637
• Polynomial identities for partitions
• On restricted partitions of numbers

Cites work

• scientific article; zbMATH DE number 3129505 (Why is no real title available?)
• Computation of \(q\)-partial fractions
• Identities in combinatorics. III: Further aspects of ordered set sorting
• On the expansion of the partition functions in a series
• Partitions into \(k\) parts
• Partitions: At the interface of \(q\)-series and modular forms
• Über Partitionen

Cited in

(16)

• On the restricted partition function
• Polyhedral geometry, supercranks, and combinatorial witnesses of congruences for partitions into three parts
• Quasipolynomials and maximal coefficients of Gaussian polynomials
• An algebraic approach to \(q\)-partial fractions and Sylvester denumerants
• Coefficients of Gaussian polynomials modulo \(N\)
• A fast algorithm for computing the number of magic series
• Partitions and Sylvester waves
• PARTITIONS
• On restricted partitions of numbers
• Log-concavity of the restricted partition function \(p_{\mathcal{A}}(n, k)\) and the new Bessenrodt-Ono type inequality
• Estimates of five restricted partition functions that are quasi polynomials
• An explicit form of the polynomial part of a restricted partition function
• Universal formulas for the number of partitions
• Towards an automation of the circle method
• A formula for the partition function that ``counts
• A generalization of partition identities for first differences of partitions of \(n\) into at most \(m\) parts

Describes a project that uses

Uses Software

• Maple
• MathOverflow

This page was built for publication: Formulæ for the number of partitions of \(n\) into at most \(m\) parts (using the quasi-polynomial ansatz)

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