Higgins, Peter M (2024) Finite regular semigroups with permutations that map elements to inverses. Semigroup Forum, 109 (1). pp. 141-147. DOI https://doi.org/10.1007/s00233-024-10430-0
Higgins, Peter M (2024) Finite regular semigroups with permutations that map elements to inverses. Semigroup Forum, 109 (1). pp. 141-147. DOI https://doi.org/10.1007/s00233-024-10430-0
Higgins, Peter M (2024) Finite regular semigroups with permutations that map elements to inverses. Semigroup Forum, 109 (1). pp. 141-147. DOI https://doi.org/10.1007/s00233-024-10430-0
Abstract
We give an account on what is known on the subject of permutation matchings, which are bijections of a finite regular semigroup that map each element to one of its inverses. This includes partial solutions to some open questions, including a related novel combinatorial problem.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Finite regular semigroup; Permutation matching; Involution |
| 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: | 19 Jul 2024 13:14 |
| Last Modified: | 30 Oct 2024 21:05 |
| URI: | http://repository.essex.ac.uk/id/eprint/38251 |
Available files
Filename: Finite regular semigroups ... Semigroup_Forum.pdf
Licence: Creative Commons: Attribution 4.0