Computation of the \(\omega\)-primality and asymptotic \(\omega\)-primality with applications to numerical semigroups.
DOI10.1007/s11856-014-1144-6zbMath1337.20067arXiv1307.5807OpenAlexW2159091683MaRDI QIDQ2339617
Alberto Vigneron-Tenorio, M. A. Moreno-Frías, Juan Ignacio García García
Publication date: 2 April 2015
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.5807
numerical semigroupsnon-unique factorizationsfactorization theoryfactorization lengthsomega-primalityArchimedean monoidsfinitely generated atomic monoids
Commutative semigroups (20M14) Free semigroups, generators and relations, word problems (20M05) Divisibility and factorizations in commutative rings (13A05) Arithmetic theory of semigroups (20M13)
Related Items (10)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semigroup-theoretical characterizations of arithmetical invariants with applications to numerical monoids and Krull monoids.
- An algorithm to compute \(\omega\)-primality in a numerical monoid.
- Atomic commutative monoids and their elasticity.
- On a generalization of the exchange property to modules with semilocal endomorphism rings.
- Local tameness of \(v\)-Noetherian monoids.
- On commutative, nonpotent archimedean semigroups
- HOW FAR IS AN ELEMENT FROM BEING PRIME?
- Chains of factorizations in weakly Krull domains
- FACTORIZATION INVARIANTS IN HALF-FACTORIAL AFFINE SEMIGROUPS
- numericalsgps, a GAP package for numerical semigroups
- Irreducible ideals of finitely generated commutative monoids
This page was built for publication: Computation of the \(\omega\)-primality and asymptotic \(\omega\)-primality with applications to numerical semigroups.