Scholarlink

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.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Some Families of Greedy Numerical Semigroups

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Arnau Messegué-Buisan,
  • Hebert Pérez-Rosés

摘要

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.