An algorithm to compute \(\omega\)-primality in a numerical monoid. (Q633183): Difference between revisions

Let \(M\) be a commutative, cancellative and atomic monoid. For a nonunit \(x\in M\) one defines \(\omega(x)\) as the smallest positive integer \(n\) such that if \(x\) divides \(a_1\cdots a_t\), then it divides some product \(a_{i_1}\cdots a_{i_n}\). The authors provide an algorithm for computing \(\omega(x)\) in the case when \(M\) is a numerical monoid (i.e., a subsemigroup of the set of positive integers with addition), generated by a finite set of integers without a common factor.