Infinite partition monoids.

From MaRDI portal




Abstract: Let mathcalPX and mathcalSX be the partition monoid and symmetric group on an infinite set X. We show that mathcalPX may be generated by mathcalSX together with two (but no fewer) additional partitions, and we classify the pairs for which mathcalPX is generated by . We also show that mathcalPX may be generated by the set mathcalEX of all idempotent partitions together with two (but no fewer) additional partitions. In fact, mathcalPX is generated by if and only if it is generated by . We also classify the pairs for which mathcalPX is generated by . Among other results, we show that any countable subset of mathcalPX is contained in a 4-generated subsemigroup of mathcalPX, and that the length function on mathcalPX is bounded with respect to any generating set.











This page was built for publication: Infinite partition monoids.

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