A combinatorial approach to Frobenius numbers of some special sequences

DOI10.1016/J.AAM.2024.102719MaRDI QIDQ6564067zbMATH OpenFDO

Authors Feihu Liu, Guoce Xin

Publication date 28 June 2024

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

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

zbMATH Keywords

Frobenius numberHilbert seriesMacMahon's partition analysisSylvester numberSylvester sum

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Other combinatorial number theory (11B75) The Frobenius problem (11D07)

Recommendations

• The Frobenius number of geometric sequences
• Sylvester power and weighted sums on the Frobenius set in arithmetic progression
• An extreme family of generalized Frobenius numbers
• scientific article; zbMATH DE number 5041220
• The Frobenius problem for special progressions

Cites work

• A Euclid style algorithm for MacMahon's partition analysis
• A fast algorithm for MacMahon's partition analysis
• Alternate Sylvester sums on the Frobenius set
• Combinatorics of the change-making problem
• Complexity of the Frobenius problem
• Computation of Hilbert functions
• Effective lattice point counting in rational convex polytopes
• Formulae for the Frobenius number in three variables
• Frobenius numbers by lattice point enumeration
• Gaps in the exponent set of primitive matrices
• scientific article; zbMATH DE number 6016068 (Why is no real title available?)
• scientific article; zbMATH DE number 3176160 (Why is no real title available?)
• scientific article; zbMATH DE number 166132 (Why is no real title available?)
• scientific article; zbMATH DE number 2229032 (Why is no real title available?)
• Lattice translates of a polytope and the Frobenius problem
• Note on Linear Forms
• Numerical semigroups.
• Numerical semigroups: Apéry sets and Hilbert series.
• On a linear Diophantine problem of Frobenius. II.
• On a Problem of Partitions
• On formulas for the Frobenius number of a numerical semigroup.
• On Sums of Positive Integers That Are Not of the Form ax + by
• On the Frobenius problem for \(\{a, ha + d, ha + bd, ha + b^{2} d,\ldots, ha+b^{k}d\}\)
• On the linear diophantine problem of Frobenius.
• Short generating functions for some semigroup algebras
• Short rational generating functions for lattice point problems
• Solution to a linear diophantine equation for nonnegative integers
• Sylvester power and weighted sums on the Frobenius set in arithmetic progression
• The Frobenius problem for modified arithmetic progressions
• Weighted Sylvester sums on the Frobenius set in more variables

Cited in

(3)

• On quotients of numerical semigroups for almost arithmetic progressions
• On the Frobenius number and genus of a collection of semigroups generalizing repunit numerical semigroups
• Fast evaluation of generalized Todd polynomials: applications to MacMahon's partition analysis and integer programming

This page was built for publication: A combinatorial approach to Frobenius numbers of some special sequences

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