\(\omega \)-primality in arithmetic Leamer monoids

DOI10.1007/s00233-019-10036-xzbMath1475.13033OpenAlexW2952357362MaRDI QIDQ2003180

Zack Tripp, Scott Thomas Chapman

Publication date: 16 July 2019

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

Full work available at URL: https://doi.org/10.1007/s00233-019-10036-x

zbMATH Keywords

non-unique factorizationomega functionnumerical monoidLeamer monoid

Mathematics Subject Classification ID

Commutative rings defined by factorization properties (e.g., atomic, factorial, half-factorial) (13F15) Arithmetic theory of semigroups (20M13)

Related Items

Geometric and combinatorial aspects of submonoids of a finite-rank free commutative monoid

Cites Work

• On the omega values of generators of embedding dimension-three numerical monoids generated by an interval
• Factorization properties of Leamer monoids.
• An algorithm to compute \(\omega\)-primality in a numerical monoid.
• Numerical semigroups.
• On factorization invariants and Hilbert functions
• Computation of the \(\omega\)-primality and asymptotic \(\omega\)-primality with applications to numerical semigroups.
• Huneke-Wiegand conjecture for complete intersection numerical semigroup rings.
• On the linearity of \(\omega\)-primality in numerical monoids.
• Measuring primality in numerical semigroups with embedding dimension three
• THE CATENARY AND TAME DEGREES ON A NUMERICAL MONOID ARE EVENTUALLY PERIODIC
• Factorization invariants in numerical monoids
• On dynamic algorithms for factorization invariants in numerical monoids
• HOW FAR IS AN ELEMENT FROM BEING PRIME?
• On Numerical Semigroups Generated by Generalized Arithmetic Sequences
• ON DELTA SETS OF NUMERICAL MONOIDS
• How Do You Measure Primality?
• The catenary and tame degree of numerical monoids