A fast algorithm for denumerants with three variables

DOI10.1016/J.JSC.2024.102414MaRDI QIDQ7030684zbMATH OpenFDO

Authors Feihu Liu, Guoce Xin

Publication date 7 February 2025

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JSC.2024.102414

zbMATH Keywords

denumerantDiophantine equationrestricted partition function

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81) Analysis of algorithms and problem complexity (68Q25)

Cites work

• A Euclid style algorithm for MacMahon's partition analysis
• A Linear Diophantine Problem
• Computing denumerants in numerical 3-semigroups
• Effective lattice point counting in rational convex polytopes
• Factoring in embedding dimension three numerical semigroups
• scientific article; zbMATH DE number 1933061 (Why is no real title available?)
• scientific article; zbMATH DE number 2051803 (Why is no real title available?)
• scientific article; zbMATH DE number 1507932 (Why is no real title available?)
• scientific article; zbMATH DE number 798657 (Why is no real title available?)
• scientific article; zbMATH DE number 2229032 (Why is no real title available?)
• scientific article; zbMATH DE number 3085850 (Why is no real title available?)
• On formulas for the Frobenius number of a numerical semigroup.
• On subinvariants i. e. semi-invariants to binary quantics of an unlimited order.
• On the number of Solutions of a Diophantine equation of Frobenius
• Partitions with parts in a finite set
• Solution to a linear diophantine equation for nonnegative integers
• The number of solutions to \(ax + by + cz = n\) and its relation to quadratic residues

This page was built for publication: A fast algorithm for denumerants with three variables

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