Orthodox semigroups and permutation matchings

被引：0

作者：

Peter M. Higgins

机构：

[1] University of Essex,Dept of Mathematical Sciences

来源：

Semigroup Forum | 2017年 / 94卷

关键词：

Orthodox semigroup; Combinatorial semigroup; Permutation matching;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

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.

引用

页码：167 / 175

页数：8