Combinatorially Factorizable Cryptic Inverse Semigroups
Canadian mathematical bulletin, Tome 57 (2014) no. 3, pp. 621-630
Voir la notice de l'article provenant de la source Cambridge University Press
An inverse semigroup $S$ is combinatorially factorizable if $S\,=\,TG$ where $T$ is a combinatorial (i.e., $\mathcal{H}$ is the equality relation) inverse subsemigroup of $S$ and $G$ is a subgroup of $S$ . This concept was introduced and studied by Mills, especially in the case when $S$ is cryptic (i.e., $\mathcal{H}$ is a congruence on $S$ ). Her approach is mainly analytical considering subsemigroups of a cryptic inverse semigroup.We start with a combinatorial inverse monoid and a factorizable Clifford monoid and from an action of the former on the latter construct the semigroups in the title. As a special case, we consider semigroups that are direct products of a combinatorial inverse monoid and a group.
Petrich, Mario. Combinatorially Factorizable Cryptic Inverse Semigroups. Canadian mathematical bulletin, Tome 57 (2014) no. 3, pp. 621-630. doi: 10.4153/CMB-2014-025-1
@article{10_4153_CMB_2014_025_1,
author = {Petrich, Mario},
title = {Combinatorially {Factorizable} {Cryptic} {Inverse} {Semigroups}},
journal = {Canadian mathematical bulletin},
pages = {621--630},
year = {2014},
volume = {57},
number = {3},
doi = {10.4153/CMB-2014-025-1},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-2014-025-1/}
}
[1] [1] Mills, J. E., Combinatorially factorizable inverse monoids. Semigroup Forum 59 (1999), 220–232. Google Scholar | DOI
[2] [2] Petrich, M., Inverse semigroups. Wiley, New York, 1984. Google Scholar
[3] [3] Petrich, M., Orthogroups with an associate subgroup. Acta Math. Hungar. 125 (2009), 1–15. Google Scholar | DOI
[4] [4] Sen, M. K., Yang, H. X., and Guo, Y. Q., A note on. relation on an inverse semigroup. J. Pure Math. 14 (1997), 1–3. Google Scholar
Cité par Sources :