Finite regular semigroups with permutations that map elements to inverses

2023/09/25 by Peter M. Higgins, Higgins, Peter M.
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Group Theory (math.GR) #Limits and Structures in Graph Theory #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.2309.14170

openalex publication_date 2023/09/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• Involution matchings, the semigroup of orientation-preserving and\n orientation-reversing mappings, and inverse covers of the full transformation\n semigroup
• Computing congruences of finite inverse semigroups
• Finite Semigroups Satisfying an Identity x₁ … x_n ≈ ρ(x₁, …, x_n)
• Some conditions from a finite regular semigroup to a finite inverse semigroup
• Permutation groups and transformation semigroups: results and problems