Finite regular semigroups with permutations that map elements to inverses
Combinatorics
2023-09-26 v1 Group Theory
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.
Cite
@article{arxiv.2309.14170,
title = {Finite regular semigroups with permutations that map elements to inverses},
author = {Peter M. Higgins},
journal= {arXiv preprint arXiv:2309.14170},
year = {2023}
}