Idempotent generation in the endomorphism monoid of a uniform partition
Abstract
Denote by and the full transformation semigroup and the symmetric group on the set , and . Let denote the set of all transformations of the finite set preserving a uniform partition of into subsets of size , where . We enumerate the idempotents of , and describe the subsemigroup generated by the idempotents . We show that , where is a direct product of copies of , and is a wreath product of with . We calculate the rank and idempotent rank of , showing that these are equal, and we also classify and enumerate all the idempotent generating sets of minimal size. In doing so, we also obtain new results about arbitrary idempotent generating sets of .
Keywords
Cite
@article{arxiv.1407.3312,
title = {Idempotent generation in the endomorphism monoid of a uniform partition},
author = {Igor Dolinka and James East},
journal= {arXiv preprint arXiv:1407.3312},
year = {2017}
}
Comments
17 pages, 6 figure, 6 tables - v2 includes some minor corrections and simplifications suggested by referee - to appear in Comm Alg