Completely (0-)simple semigroups and maximal quotient semigroups (Q1318912)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Completely (0-)simple semigroups and maximal quotient semigroups |
scientific article |
Statements
Completely (0-)simple semigroups and maximal quotient semigroups (English)
0 references
12 April 1994
0 references
A semigroup \(S\) is called right (left) reductive if for \(s_ 1,s_ 2 \in S\) we have that \(s_ 1 t = s_ 2 t\) (\(ts_ 1 = ts_ 2\)) for all \(t \in S\) implies \(s_ 1 = s_ 2\). This is equivalent to saying that \(S\) has a maximal right (left) quotient semigroup. The author gives conditions for a completely 0-simple and a completely simple semigroup \(S\) to be right reductive in terms of the sandwich matrix \(P\) used in the matrix representation \(M^ 0[G;I,\Lambda;P]\) or \(M[G;I,\Lambda;P]\) of \(S\). In this case the maximal right quotient semigroup is described in either case as a certain column monomial matrix semigroup over \(G\).
0 references
right reductive semigroup
0 references
Rees matrix semigroup
0 references
completely simple semigroup
0 references
sandwich matrix
0 references
matrix representation
0 references
maximal right quotient semigroup
0 references
column monomial matrix semigroup
0 references