On strongly primary monoids, with a focus on Puiseux monoids

Abstract

Primary and strongly primary monoids and domains play a central role in the ideal and factorization theory of commutative monoids and domains. Among others, it is known that primary monoids satisfying the ascending chain condition on divisorial ideals (e.g., numerical monoids) are strongly primary; and the multiplicative monoid of non-zero elements of a one-dimensional local domain is primary and it is strongly primary if the domain is noetherian. In the present paper, we focus on the study of additive submonoids of the non-negative rationals, called Puiseux monoids. It is easy to see that Puiseux monoids are primary monoids, and we provide conditions ensuring that they are strongly primary. Then we study local and global tameness of strongly primary Puiseux monoids; most notably, we establish an algebraic characterization of when a Puiseux monoid is globally tame. Moreover, we obtain a result on the structure of sets of lengths of all locally tame strongly primary monoids.

On the sets of lengths of Puiseux monoids generated by multiple geometric sequences

“…This paper introduces a family of Puiseux monoids that constitutes a generalization of rational cyclic semirings, i.e., Puiseux monoids generated by the elements of a geometric progression. Systems of sets of lengths have been studied in the context of Krull monoids [14], C-monoids [8], affine monoids [10], and submonoids of N d [19] (see also [12,7] for some recent work). Given that Puiseux monoids started receiving attention just a few years ago, little is known about its system of sets of lengths (for recent progress see [16,21]).…”