Let
be a multiplicatively written monoid with identity
(in particular, a
group), and denote by
the monoid obtained by endowing the collection of all finite subsets of
containing a unit with the operation of setwise multiplication
. We study
fundamental features of the arithmetic of this and related structures, with a focus on the
submonoid,
, of
consisting of all
finite subsets of
containing the identity.
Among others, we establish that
is atomic (i.e., each nonunit is a product of atoms) if and only if
for every
. Then we
prove that
is BF (i.e., it is atomic and every element has factorizations of bounded length) if and
only if
is torsion-free; and we show how to transfer these conclusions from
to
through the machinery of equimorphisms.
Next, we introduce a suitable notion of “minimal factorization” (and investigate its
behavior with respect to equimorphisms) to account for the fact that monoids may
have nontrivial idempotents, in which case standard definitions from factorization
theory degenerate. Accordingly, we obtain necessary and sufficient conditions for
to be BmF (meaning that each nonunit has at least one minimal
factorization and all such factorizations are bounded in 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 nonunit 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.
|