Computation of the -primality and asymptotic -primality with applications to numerical semigroups.

DOI10.1007/S11856-014-1144-6zbMATH Open1337.20067arXiv1307.5807OpenAlexW2159091683MaRDI QIDQ2339617FDOQ2339617

Authors: M. A. Moreno-Frías, A. Vigneron-Tenorio, J. I. García-García 

Publication date: 2 April 2015

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Abstract: We give an algorithm to compute the $omega$-primality of finitely generated atomic monoids. Asymptotic $w$-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.

Full work available at URL: https://arxiv.org/abs/1307.5807

Recommendations

• An algorithm to compute \(\omega\)-primality in a numerical monoid.
• \(\omega \)-primality in arithmetic Leamer monoids
• An improved algorithm to compute the \(\omega\)-primality
• On the linearity of \(\omega\)-primality in numerical monoids.
• Measuring primality in numerical semigroups with embedding dimension three.

zbMATH Keywords

numerical semigroupsnon-unique factorizationsfactorization theoryfactorization lengthsomega-primalityArchimedean monoidsfinitely generated atomic monoids

Mathematics Subject Classification ID

Commutative semigroups (20M14) Free semigroups, generators and relations, word problems (20M05) Divisibility and factorizations in commutative rings (13A05) Arithmetic theory of semigroups (20M13)

Cites Work

• numericalsgps, a GAP package for numerical semigroups
• Non-unique factorizations. Algebraic, combinatorial and analytic theory
• Semigroup-theoretical characterizations of arithmetical invariants with applications to numerical monoids and Krull monoids.
• Title not available (Why is that?)
• Local tameness of \(v\)-Noetherian monoids.
• HOW FAR IS AN ELEMENT FROM BEING PRIME?
• An algorithm to compute \(\omega\)-primality in a numerical monoid.
• Title not available (Why is that?)
• Irreducible ideals of finitely generated commutative monoids
• Atomic commutative monoids and their elasticity.
• On commutative, nonpotent archimedean semigroups
• Chains of factorizations in weakly Krull domains
• Factorization invariants in half-factorial affine semigroups.
• On a generalization of the exchange property to modules with semilocal endomorphism rings.
• Title not available (Why is that?)

Cited In (18)

• On the omega values of generators of embedding dimension-three numerical monoids generated by an interval
• Factorization invariants of Puiseux monoids generated by geometric sequences
• How do you measure primality?
• On divisor-closed submonoids and minimal distances in finitely generated monoids
• On the linearity of \(\omega\)-primality in numerical monoids.
• Factorizations of the same length in abelian monoids
• \(\omega \)-primality in arithmetic Leamer monoids
• Factorization length distribution for affine semigroups. I: Numerical semigroups with three generators
• Factorization invariants in numerical monoids
• Factorization invariants of the additive structure of exponential Puiseux semirings
• Measuring primality in numerical semigroups with embedding dimension three.
• A mathematical programming approach to the computation of the omega invariant of a numerical semigroup
• An improved algorithm to compute the \(\omega\)-primality
• On dynamic algorithms for factorization invariants in numerical monoids
• Class group and factorization in orders of a PID
• The computation of factorization invariants for affine semigroups
• An algorithm to compute \(\omega\)-primality in a numerical monoid.
• On factorization invariants and Hilbert functions

Uses Software

• numericalsgps
• OmegaPrimality

This page was built for publication: Computation of the \(\omega\)-primality and asymptotic \(\omega\)-primality with applications to numerical semigroups.

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