Greedy Sets and Greedy Numerical Semigroups

Autor:	Pérez-Rosés, Hebert, Serradilla-Merinero, José Miguel, Bras-Amorós, Maria
Rok vydání:	2024
Předmět:	Mathematics - Combinatorics Computer Science - Discrete Mathematics Mathematics - Number Theory 06F05 11Y55 68R05 F.2.2 G.2.1
Druh dokumentu:	Working Paper
Popis:	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 greedy. Comment: Accepted for publication in Communications in Algebra, Taylor and Francis group. Contains 23 pages, 2 tables, 4 algorithms
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2412.10884 Zobrazit plný text záznamu View this record from Arxiv