Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the arithmetic of power monoids

Published 11 Mar 2025 in math.RA | (2503.08615v2)

Abstract: Given a monoid $H$ (written multiplicatively), the family $\mathcal P_{{\rm fin},1}(H)$ of all non-empty finite subsets of $H$ that contain the identity $1_H$ is itself a monoid (called the reduced finitary power monoid of $H$) when equipped with the operation of setwise multiplication induced by $H$. We investigate the arithmetic of $\mathcal P_{{\rm fin},1}(H)$ from the perspective of minimal factorizations into irreducibles, paying particular attention to the potential presence of non-trivial idempotents. Among other results, we provide necessary and sufficient conditions on $H$ for $\mathcal P_{{\rm fin},1}(H)$ to admit unique minimal factorizations. Our results generalize and shed new light on recent developments on the topic.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.