On the arithmetic of power monoids and sumsets in cyclic groups

From MaRDI portal
Publication:1979485




Abstract: Let H be a multiplicatively written monoid with identity 1H (in particular, a group). We denote by mathcalPmfin,imes(H) the monoid obtained by endowing the collection of all finite subsets of H containing a unit with the operation of setwise multiplication (X,Y)mapstoxy:xinX,yinY; and study fundamental features of the arithmetic of this and related structures, with a focus on the submonoid, mathcalPextfin,1(H), of mathcalPextfin,imes(H) consisting of all finite subsets X of H with 1HinX. Among others, we prove that mathcalPextfin,1(H) is atomic (i.e., each non-unit is a product of irreducibles) iff 1Hex2ex for every xinHsetminus1H. Then we obtain that mathcalPextfin,1(H) is BF (i.e., it is atomic and every element has factorizations of bounded length) iff H is torsion-free; and show how to transfer these conclusions to mathcalPextfin,imes(H). 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 mathcalPextfin,imes(H) to be BmF (meaning that each non-unit has minimal factorizations of bounded length); and for mathcalPextfin,1(H) 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 mathcalPextfin,1(H). Many proofs come down to considering sumset decompositions in cyclic groups, so giving rise to an intriguing interplay with Arithmetic Combinatorics.



Cites work







This page was built for publication: On the arithmetic of power monoids and sumsets in cyclic groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1979485)