The isomorphism problem for reduced finitary power monoids
Combinatorics
2026-02-02 v1
Abstract
Let be a multiplicatively written monoid with identity and let denote the reduced finitary power monoid of , that is, the monoid consisting of all finite subsets of containing with set multiplication as operation. Building on work of Tringali and Yan, we give a complete description of pairs of commutative and cancellative monoids for which and are isomorphic.
Keywords
Cite
@article{arxiv.2601.22469,
title = {The isomorphism problem for reduced finitary power monoids},
author = {Balint Rago},
journal= {arXiv preprint arXiv:2601.22469},
year = {2026}
}