Higgins, Peter M (2017) Orthodox semigroups and permutation matchings. Semigroup Forum, 94 (1). pp. 167-175. DOI https://doi.org/10.1007/s00233-016-9831-8
Higgins, Peter M (2017) Orthodox semigroups and permutation matchings. Semigroup Forum, 94 (1). pp. 167-175. DOI https://doi.org/10.1007/s00233-016-9831-8
Higgins, Peter M (2017) Orthodox semigroups and permutation matchings. Semigroup Forum, 94 (1). pp. 167-175. DOI https://doi.org/10.1007/s00233-016-9831-8
Abstract
We determine when an orthodox semigroup S has a permutation that sends each member of S to one of its inverses and show that if such a permutation exists, it may be taken to be an involution. In the case of a finite orthodox semigroup the condition is an effective one involving Green’s relations on the combinatorial images of the principal factors of S. We also characterise some classes of semigroups via their permutation matchings.
| Item Type: | Article |
|---|---|
| Additional Information: | 13 pages |
| Uncontrolled Keywords: | Orthodox semigroup; Combinatorial semigroup; Permutation matching |
| Subjects: | Q Science > QA Mathematics |
| Divisions: | Faculty of Science and Health Faculty of Science and Health > Mathematics, Statistics and Actuarial Science, School of |
| SWORD Depositor: | Unnamed user with email elements@essex.ac.uk |
| Depositing User: | Unnamed user with email elements@essex.ac.uk |
| Date Deposited: | 17 Oct 2016 15:04 |
| Last Modified: | 30 Oct 2024 16:38 |
| URI: | http://repository.essex.ac.uk/id/eprint/17783 |