Formulæ for the number of partitions of \(n\) into at most \(m\) parts (using the quasi-polynomial ansatz)
From MaRDI portal
Publication:424536
DOI10.1016/j.aam.2011.12.003zbMath1242.05020arXiv1108.4391OpenAlexW3101730344MaRDI QIDQ424536
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
Symbolic computation and algebraic computation (68W30) Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81)
Related Items (14)
Partitions and Sylvester waves ⋮ A formula for the partition function that ``counts ⋮ On the restricted partition function ⋮ A fast algorithm for computing the number of magic series ⋮ Polyhedral geometry, supercranks, and combinatorial witnesses of congruences for partitions into three parts ⋮ Log-concavity of the restricted partition function \(p_{\mathcal{A}}(n, k)\) and the new Bessenrodt-Ono type inequality ⋮ On restricted partitions of numbers ⋮ An explicit form of the polynomial part of a restricted partition function ⋮ 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 ⋮ PARTITIONS ⋮ Coefficients of Gaussian polynomials modulo \(N\) ⋮ An algebraic approach to \(q\)-partial fractions and Sylvester denumerants
Uses Software
Cites Work
This page was built for publication: Formulæ for the number of partitions of \(n\) into at most \(m\) parts (using the quasi-polynomial ansatz)
