arXiv Analytics

Sign in

arXiv:0911.0445 [math.GR]AbstractReferencesReviewsResources

Groups that together with any transformation generate regular semigroups or idempotent generated semigroups

Joao Araujo, J. D. Mitchell, Csaba Schneider

Published 2009-11-02Version 1

Let $a$ be a non-invertible transformation of a finite set and let $G$ be a group of permutations on that same set. Then $\genset{G, a}\setminus G$ is a subsemigroup, consisting of all non-invertible transformations, in the semigroup generated by $G$ and $a$. Likewise, the conjugates $a^g=g^{-1}ag$ of $a$ by elements $g\in G$ generate a semigroup denoted $\genset{a^g | g\in G}$. We classify the finite permutation groups $G$ on a finite set $X$ such that the semigroups $\genset{G,a}$, $\genset{G, a}\setminus G$, and $\genset{a^g | g\in G}$ are regular for all transformations of $X$. We also classify the permutation groups $G$ on a finite set $X$ such that the semigroups $\genset{G, a}\setminus G$ and $\genset{a^g | g\in G}$ are generated by their idempotents for all non-invertible transformations of $X$.

Related articles: Most relevant | Search more
arXiv:1007.4845 [math.GR] (Published 2010-07-27)
The Largest Subsemilattices of the Semigroup of Transformations on a Finite Set
arXiv:2009.05627 [math.GR] (Published 2020-09-11)
Block-groups and Hall relations
arXiv:2102.00448 [math.GR] (Published 2021-01-31)
Orbits of Sylow subgroups of finite permutation groups