Orthodox semigroups and permutation matchings
From MaRDI portal
Publication:2361729
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.
Recommendations
- Permutations of a semigroup that map to inverses.
- Certain subsemigroups of orthodox semigroups
- Congruences on orthodox semirings whose additive idempotents satisfy permutation identities.
- Involution matchings, the semigroup of orientation-preserving and orientation-reversing mappings, and inverse covers of the full transformation semigroup
- scientific article; zbMATH DE number 3933344
Cites work
- scientific article; zbMATH DE number 3706718 (Why is no real title available?)
- scientific article; zbMATH DE number 52907 (Why is no real title available?)
- scientific article; zbMATH DE number 789816 (Why is no real title available?)
- Permutations of a semigroup that map to inverses.
- Симметрическая полугруппа преоъраэований покрывается своими инверсными подполугруппами
Cited in
(3)
This page was built for publication: Orthodox semigroups and permutation matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2361729)