On the isomorphism problem for power semigroups
arXiv:2402.11475
Abstract
Let be the semigroup obtained by equipping the family of all non-empty subsets of a (multiplicatively written) semigroup with the operation of setwise multiplication induced by itself. We call a subsemigroup of downward complete if any element of lies in at least one set and any non-empty subset of a set in is still in . We obtain, for a commutative semigroup , a characterization of the cancellative elements of a downward complete subsemigroup of in terms of the cancellative elements of . Consequently, we show that, if and are cancellative semigroups and either of them is commutative, then every isomorphism from a downward complete subsemigroup of to a downward complete subsemigroup of restricts to an isomorphism from to . This solves a special case of a problem of Tamura and Shafer from the late 1960s and generalizes a recent result by Bienvenu and Geroldinger, where it is assumed, among other conditions, that and are numerical monoids.
arXiv comment9 pages, no figures. Final version to appear in M. Brešar, A. Geroldinger, B. Olberding, and D. Smertnig (eds.), Recent Progress in Ring and Factorization Theory, Springer Proc. Math. Stat., Springer, 202?