Abstract
The computation of ω-primality has been object of study, mainly, for numerical semigroups due to its multiple applications to the Factorization Theory. However, its asymptotic version is less well known. In this work, we study the asymptotic ω-primality for finitely generated cancelative commutative monoids. By using discrete geometry tools and the Python programming language we present an algorithm to compute this parameter. Moreover, we improve the proof of a known result for numerical semigroups.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
