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

DOI10.1016/J.AAM.2011.12.003zbMATH Open1242.05020arXiv1108.4391OpenAlexW3101730344MaRDI QIDQ424536FDOQ424536

Authors: Andrew V. Sills, Doron Zeilberger 

Publication date: 1 June 2012

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

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.

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

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

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)

Cites Work

• Identities in combinatorics. III: Further aspects of ordered set sorting
• Partitions: At the interface of \(q\)-series and modular forms
• On the expansion of the partition functions in a series
• Partitions into \(k\) parts
• Title not available (Why is that?)
• Computation of \(q\)-partial fractions
• Über Partitionen

Cited In (16)

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

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)