Infinite partition monoids

preprint2014arXivOpen access

Abstract

Let PX\mathcal P_X and SX\mathcal S_X be the partition monoid and symmetric group on an infinite set XX. We show that PX\mathcal P_X may be generated by SX\mathcal S_X together with two (but no fewer) additional partitions, and we classify the pairs α,β∈PXα,β\in\mathcal P_X for which PX\mathcal P_X is generated by SX∪{α,β}\mathcal S_X\cup\{α,β\}. We also show that PX\mathcal P_X may be generated by the set EX\mathcal E_X of all idempotent partitions together with two (but no fewer) additional partitions. In fact, PX\mathcal P_X is generated by EX∪{α,β}\mathcal E_X\cup\{α,β\} if and only if it is generated by EX∪SX∪{α,β}\mathcal E_X\cup\mathcal S_X\cup\{α,β\}. We also classify the pairs α,β∈PXα,β\in\mathcal P_X for which PX\mathcal P_X is generated by EX∪{α,β}\mathcal E_X\cup\{α,β\}. Among other results, we show that any countable subset of PX\mathcal P_X is contained in a 44-generated subsemigroup of PX\mathcal P_X, and that the length function on PX\mathcal P_X is bounded with respect to any generating set.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.