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.


The paper studies generation properties for partition monoids on arbitrary sets. The main result asserts that the partition monoid can be generated by its group of invertible elements with at least two additional partitions and all pairs of such partitions are classified. There is also a classification of all pairs of partitions which, together with all idempotents, generate the partition monoid. There are also some bonus results, in particular, it is shown that any countable subset of the partition monoid is contained in a 4-generated subsemigroup, and that the length function on the partition monoid is bounded for 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)