Computation of delta sets of numerical monoids.

From MaRDI portal




Abstract: Let a1,dots,ap be the minimal generating set of a numerical monoid S. For any sinS, its Delta set is defined by Delta(s)=lili1|i=2,dots,k where l1<dots<lk is the set sumi=1pxi,|,s=sumi=1pxiaiextrmandxiinNextrmforalli. The Delta set of S, denoted by Delta(S), is the union of all the sets Delta(s) with sinS. As proved in [S.T. Chapman, R. Hoyer, and N. Kaplan. Delta sets of numerical monoids are eventually periodic. Aequationes Math. 77 (2009), no. 3, 273--279], there exists a bound N such that Delta(S) is the union of the sets Delta(s) with sinS and s<N. In this work, by using geometrical tools, we obtain a sharpened bound and we give an algorithm to compute Delta(S) from the factorizations of only a1 elements.




Cited in
(27)


Describes a project that uses

Uses Software





This page was built for publication: Computation of delta sets of numerical monoids.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q889031)