Some Families of Greedy Numerical Semigroups
Abstract
The change-making problem was recently extended to sets of positive integers not containing the element $1$, and from there to numerical semigroups. A greedy numerical semigroup is defined as a numerical semigroup where the greedy representation of an element is optimal with respect to the number of summands. In this paper we identify some new families of greedy numerical semigroups.
Fields of Study & Subjects
Commutative Algebra and Its Applications
Advanced Combinatorial Mathematics
semigroups and automata theory
Publication details
- Journal / source
- arXiv (Cornell University)
- Publication date
- 22 February 2026
- Language
- EN
- Document type
- Preprint