paper

On the Arithmetic of Power Monoids and Sumsets in Cyclic Groups

arXiv:1804.10913 · doi:10.2140/pjm.2021.312.279

Abstract

Let be a multiplicatively written monoid with identity (in particular, a group). We denote by the monoid obtained by endowing the collection of all finite subsets of containing a unit with the operation of setwise multiplication ; and study fundamental features of the arithmetic of this and related structures, with a focus on the submonoid, , of consisting of all finite subsets of with . Among others, we prove that is atomic (i.e., each non-unit is a product of irreducibles) iff for every . Then we obtain that is BF (i.e., it is atomic and every element has factorizations of bounded length) iff is torsion-free; and show how to transfer these conclusions to . Next, we introduce "minimal factorizations" to account for the fact that monoids may have non-trivial idempotents, in which case standard definitions from Factorization Theory degenerate. Accordingly, we obtain conditions for to be BmF (meaning that each non-unit has minimal factorizations of bounded length); and for to be BmF, HmF (i.e., a BmF-monoid where all the minimal factorizations of a given element have the same length), or minimally factorial (i.e., a BmF-monoid where each element has an essentially unique minimal factorization). Finally, we prove how to realize certain intervals as sets of minimal lengths in . Many proofs come down to considering sumset decompositions in cyclic groups, so giving rise to an intriguing interplay with Arithmetic Combinatorics.

23 pp., 1 figure (on p. 4). Fixed minor details and added Sect. 2.4 and Remarks 4.2 and 4.6. To appear in Pacific Journal of Mathematics

References in corpus (3)

Cited by in corpus (13)