RT journal article
T1 Computation of Delta sets of numerical monoids
A1 García García, Juan Ignacio
A1 Moreno Frías, María Ángeles
A1 Vigneron Tenorio, Alberto
A2 Matemáticas
K1 Delta set
K1 Non-unique factorization
K1 Numerical monoid
K1 Numerical semigroup
AB Let {a1, . . . , ap} be the minimal generating set of a numerical monoid S. For any s ∈ S, its Delta set is defined by Δ(S) = {li − li−1 | i = 2, . . . , k} where {l1 < · · · < lk } is the set {∑^pi=1 xi | s = {∑^p i=1 xi ai and xi ∈ N for all i }. TheDelta set of a numerical monoid S, denoted by Δ(S), is the union of all the sets Δ(s)with s ∈ S. As proved in Chapman et al. (Aequationes Math. 77(3):273–279, 2009),there exists a bound N such that Δ(S) is the union of the sets Δ(s) with s ∈ S ands < N. In this work, we obtain a sharpened bound and we present an algorithm forthe computation of Δ(S) that requires only the factorizations of a1 elements.
PB Springer
SN 0026-9255
YR 2015
FD 2015
LK http://hdl.handle.net/10498/35347
UL http://hdl.handle.net/10498/35347
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 10-may-2026