A generalization of Sylvester's and Frobenius' problems on numerical semigroups

DOI10.4064/AA-65-4-353-366MaRDI QIDQ4289958zbMATH OpenOpenAlexFDO

Authors Zdzisław Skupień

Publication date 13 June 1994

Published in Acta Arithmetica (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/206585

zbMATH Keywords

upper boundnumerical semigroupopen problemsFrobenius problemlinear diophantine equationpseudo-polynomial algorithmsinteger sumsetsmodular change problem

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Linear Diophantine equations (11D04)

Recommendations

• Frobenius Coin-Exchange Generating Functions
• Computing and Combinatorics
• scientific article; zbMATH DE number 1320681
• An extreme family of generalized Frobenius numbers
• On numerical semigroups

Cited in

(11)

• Exponentially many hypohamiltonian snarks
• Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture
• On the total coloring of generalized Petersen graphs
• The Frobenius problem for repunit numerical semigroups.
• scientific article; zbMATH DE number 7233012 (Why is no real title available?)
• Multifold tiles of polyominoes and convex lattice polygons
• Numerical Semigroups and the Game of Sylver Coinage
• Remark on linear forms
• On the Frobenius number of certain numerical semigroups
• Periodicity of a partition function related to making change modulo prime powers.
• Relative symmetric polynomials and money change problem

This page was built for publication: A generalization of Sylvester's and Frobenius' problems on numerical semigroups

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