Greedy sets and greedy numerical semigroups

DOI10.1080/00927872.2024.2444625MaRDI QIDQ7000240zbMATH OpenFDO

Authors Hebert Pérez-Rosés, José Miguel Serradilla-Merinero, Maria Bras-Amorós

Publication date 8 April 2025

Published in Communications in Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00927872.2024.2444625

Mathematics Subject Classification ID

Ordered semigroups and monoids (06F05) Calculation of integer sequences (11Y55) Combinatorics in computer science (68R05)

Cites work

• A polynomial-time algorithm for the change-making problem
• Factoring in the Chicken McNugget monoid
• Frobenius numbers of numerical semigroups generated by three consecutive squares or cubes.
• Frobenius problem for three arguments
• Greedy routing in circulant networks
• Minimal genus of a multiple and Frobenius number of a quotient of a numerical semigroup
• Minimal presentations of shifted numerical monoids
• Optimal bounds for the change-making problem
• Symmetric Numerical Semigroups Generated by Fibonacci and Lucas Triples
• The Frobenius problem for numerical semigroups with embedding dimension equal to three
• The Frobenius problems for sexy prime triplets
• The numerical duplication of a numerical semigroup.
• WHEN IS A NUMERICAL SEMIGROUP A QUOTIENT?

Cited in

(1)

• Some families of greedy numerical semigroups

This page was built for publication: Greedy sets and greedy numerical semigroups

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