A polynomial time algorithm for Sylvester waves when entries are bounded

DOI10.1016/J.AAM.2025.102931MaRDI QIDQ6939595zbMATH OpenFDO

Authors Guoce Xin, Chen Zhang

Publication date 21 August 2025

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

Full work available at URL https://doi.org/10.1016/J.AAM.2025.102931

zbMATH Keywords

cyclotomic polynomialSylvester waveSylvester's denumerant

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Computational methods for problems pertaining to combinatorics (05-08) Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81)

Cites work

• An algebraic approach to \(q\)-partial fractions and Sylvester denumerants
• An algebraic combinatorial approach to Sylvester's denumerant
• Coefficients of Sylvester's denumerant
• Computing denumerants in numerical 3-semigroups
• Fast evaluation of generalized Todd polynomials: applications to MacMahon's partition analysis and integer programming
• Formulæ for the number of partitions of n into at most m parts (using the quasi-polynomial ansatz)
• scientific article; zbMATH DE number 1933244 (Why is no real title available?)
• scientific article; zbMATH DE number 798657 (Why is no real title available?)
• Modern computer algebra
• Partitions and Sylvester waves
• Partitions: At the interface of \(q\)-series and modular forms
• Revisiting the saddle-point method of Perron
• Sylvester waves in the Coxeter groups

This page was built for publication: A polynomial time algorithm for Sylvester waves when entries are bounded

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