An algorithm to compute -primality in a numerical monoid.

DOI10.1007/S00233-010-9259-5MaRDI QIDQ633183zbMATH OpenOpenAlexFDO

Authors David F. Anderson, Nathan Kaplan, Desmond Torkornoo, Scott T. 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

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

Recommendations

• Computation of the \(\omega\)-primality and asymptotic \(\omega\)-primality with applications to numerical semigroups.
• How do you measure primality?
• On the linearity of \(\omega\)-primality in numerical monoids.
• \(\omega \)-primality in arithmetic Leamer monoids
• Measuring primality in numerical semigroups with embedding dimension three.

Cites work

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

Cited in

(19)

• 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
• On divisor-closed submonoids and minimal distances in finitely generated monoids
• How do you measure primality?
• On the linearity of \(\omega\)-primality in numerical monoids.
• \(\omega \)-primality in arithmetic Leamer monoids
• Factoring in the Chicken McNugget monoid
• Semigroup-theoretical characterizations of arithmetical invariants with applications to numerical monoids and Krull monoids.
• On bounding measures of primeness in integral domains
• Factorization invariants in numerical monoids
• Computation of the \(\omega\)-primality and asymptotic \(\omega\)-primality with applications to numerical semigroups.
• Measuring primality in numerical semigroups with embedding dimension three.
• Factorization invariants of the additive structure of exponential Puiseux semirings
• A mathematical programming approach to the computation of the omega invariant of a numerical semigroup
• An improved algorithm to compute the \(\omega\)-primality
• The Importance of Being Prime ^⋆ , a Nontrivial Generalization for Nonunique Factorizations
• On dynamic algorithms for factorization invariants in numerical monoids
• Class group and factorization in orders of a PID
• On the arithmetic of tame monoids with applications to Krull monoids and Mori domains.

This page was built for publication: An algorithm to compute \(\omega\)-primality in a numerical monoid.

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