An algorithm to compute -primality in a numerical monoid.
DOI10.1007/S00233-010-9259-5zbMATH Open1218.20038OpenAlexW2080185879MaRDI QIDQ633183FDOQ633183
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
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.
Other combinatorial number theory (11B75) Commutative semigroups (20M14) Free semigroups, generators and relations, word problems (20M05) The Frobenius problem (11D07)
Cites Work
- Non-unique factorizations. Algebraic, combinatorial and analytic theory
- Numerical semigroups.
- ON DELTA SETS OF NUMERICAL MONOIDS
- The catenary and tame degree of numerical monoids generated by generalized arithmetic sequences.
- Local tameness of \(v\)-Noetherian monoids.
- Full elasticity in atomic monoids and integral domains.
- HOW FAR IS AN ELEMENT FROM BEING PRIME?
- Delta sets of numerical monoids are eventually periodic.
- Shifts of generators and delta sets of numerical monoids.
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
- 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.
- \(\omega \)-primality in arithmetic Leamer monoids
- Factoring in the Chicken McNugget monoid
- On bounding measures of primeness in integral domains
- Semigroup-theoretical characterizations of arithmetical invariants with applications to numerical monoids and Krull monoids.
- Factorization invariants in numerical monoids
- Computation of the \(\omega\)-primality and asymptotic \(\omega\)-primality with applications to numerical semigroups.
- 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
- The Importance of Being Prime ⋆ , a Nontrivial Generalization for Nonunique Factorizations
- 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
- 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)
