An algorithm to compute \(\omega\)-primality in a numerical monoid.

DOI10.1007/s00233-010-9259-5zbMath1218.20038OpenAlexW2080185879MaRDI QIDQ633183

David F. Anderson, Nathan Kaplan, Desmond Torkornoo, Scott Thomas Chapman

Publication date: 31 March 2011

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00233-010-9259-5

zbMATH Keywords

algorithmsatomsnon-unique factorizationsatomic monoidsnumerical monoidsnonunitsomega-primality

Mathematics Subject Classification ID

Commutative semigroups (20M14) Free semigroups, generators and relations, word problems (20M05) Other combinatorial number theory (11B75) The Frobenius problem (11D07)

Related Items

Factorization invariants of the additive structure of exponential Puiseux semirings, ON BOUNDING MEASURES OF PRIMENESS IN INTEGRAL DOMAINS, Semigroup-theoretical characterizations of arithmetical invariants with applications to numerical monoids and Krull monoids., The Importance of Being Prime ^⋆ , a Nontrivial Generalization for Nonunique Factorizations, A mathematical programming approach to the computation of the omega invariant of a numerical semigroup, Factorization invariants in numerical monoids, On the linearity of \(\omega\)-primality in numerical monoids., On dynamic algorithms for factorization invariants in numerical monoids, Factoring in the Chicken McNugget Monoid, On divisor-closed submonoids and minimal distances in finitely generated monoids, An improved algorithm to compute the \(\omega\)-primality, \(\omega \)-primality in arithmetic Leamer monoids, Measuring primality in numerical semigroups with embedding dimension three, On the arithmetic of tame monoids with applications to Krull monoids and Mori domains., Factorization invariants of Puiseux monoids generated by geometric sequences, Computation of the \(\omega\)-primality and asymptotic \(\omega\)-primality with applications to numerical semigroups.

Cites Work

• Unnamed Item
• Delta sets of numerical monoids are eventually periodic.
• Numerical semigroups.
• Local tameness of \(v\)-Noetherian monoids.
• Full elasticity in atomic monoids and integral domains.
• The catenary and tame degree of numerical monoids generated by generalized arithmetic sequences
• Shifts of generators and delta sets of numerical monoids
• HOW FAR IS AN ELEMENT FROM BEING PRIME?
• ON DELTA SETS OF NUMERICAL MONOIDS