Computation of the ω-primality and asymptotic ω-primality with applications to numerical semigroups
- 77 Downloads
We give an algorithm to compute the ω-primality of finitely generated atomic monoids. Asymptotic ω-primality is also studied and a formula to obtain it in finitely generated quasi-Archimedean monoids is proven. The formulation is applied to numerical semigroups, obtaining an expression of this invariant in terms of its system of generators.
KeywordsNumerical Semigroup Commutative Monoids Cancellative Semigroup Cancellative Monoid Archimedean Semigroup
Unable to display preview. Download preview PDF.
- M. Delgado, P. A. García-Sánchez and J. Morais, “NumericalSgps”: a GAP package for numerical semigroups, http://www.gap-system.org/Packages/numericalsgps.html
- J. I. García-García and A. Vigneron-Tenorio, OmegaPrimality, a package for computing the omega primality of finitely generated atomic monoids, Handle: http://hdl.handle.net/10498/15961 (2014).
- L. Redéi, The Theory of Finitely Generated Commutative Monoids, Pergamon Press, Oxford-Edinburgh-New York, 1965.Google Scholar
- J. C. Rosales and J. I. García-García, Hereditary archimedean commutative semigroups, International Mathematical Journal 5 (2002), 467–472.Google Scholar