On the Linearity of ω-primality in Numerical Monoids
arXiv:1309.7476 · doi:10.1016/j.jpaa.2014.01.002
Abstract
In an atomic, cancellative, commutative monoid, the ω-value measures how far an element is from being prime. In numerical monoids, we show that this invariant exhibits eventual quasilinearity (i.e., periodic linearity). We apply this result to describe the asymptotic behavior of the ω-function for a general numerical monoid and give an explicit formula when the monoid has embedding dimension 2.
Cited by in corpus (10)
- numericalsgps, a GAP package for numerical semigroups
- Sparse solutions of linear Diophantine equations
- On the set of elasticities in numerical monoids
- On dynamic algorithms for factorization invariants in numerical monoids
- On factorization invariants and Hilbert functions
- How Do You Measure Primality?
- Factorization invariants in numerical monoids
- On the set of catenary degrees of finitely generated cancellative commutative monoids
- Factorization Properties of Leamer Monoids
- Augmented Hilbert series of numerical semigroups