Greedy Sets and Greedy Numerical Semigroups

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

作者机构：Dept. of Computer Science and Mathematics Universitat Rovira i Virgili Avda. Paisos Catalans 26 Catalonia Tarragona43007 Spain 

出 版 物：《arXiv》 (arXiv)

年 卷 期：2024年

核心收录：

主　　题：Consensus algorithm 

摘      要：Motivated by the change-making problem, we extend the notion of greediness to sets of positive integers not containing the element 1, and from there to numerical semigroups. We provide an algorithm to determine if a given set (not necessarily containing the number 1) is greedy. We also give specific conditions for sets of cardinality three, and we prove that numerical semigroups generated by three consecutive integers are *** Codes 06F05, 11Y55, 68R05 Copyright © 2024, The Authors. All rights reserved.