REVIEW 2 cited by
On the atomicity of power monoids of Puiseux monoids
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
A submonoid of the additive group $\mathbb{Q}$ is called a Puiseux monoid if it consists of nonnegative rationals. Given a monoid $M$, the set consisting of all nonempty finite subsets of $M$ is also a monoid under the Minkowski sum, and it is called the (finitary) power monoid of $M$. In this paper we study atomicity and factorization properties in power monoids of Puiseux monoids. We specially focus on the ascent of the property of being atomic and both the bounded and the finite factorization properties (the ascending chain on principal ideals and the length-finite factorization properties are also considered here). We prove that both the bounded and the finite factorization properties ascend from any Puiseux monoid to its power monoid. On the other hand, we construct an atomic Puiseux monoid whose power monoid is not atomic. We also prove that the existence of maximal common divisors for nonempty finite subsets is a sufficient condition for the property of being atomic to ascend from a Puiseux monoid to its power monoid.
Forward citations
Cited by 2 Pith papers
-
On finitary power monoids of linearly orderable monoids
For linearly orderable monoids, quasi-ACCP and almost ACCP ascend to finitary power monoids, while atomicity, near atomicity, and quasi-atomicity do not; atomic power monoids are characterized as those from atomic MCD...
-
On primality and atomicity of numerical power monoids
Restricted numerical power monoids have no primal elements, and the distribution of atom sizes in P_fin,0(N_0) is asymptotically binomial with parameters n and 1/2.
Discussion (0). Continue with ORCID to comment.