2000
DOI: 10.1007/pl00010089
|View full text |Cite
|
Sign up to set email alerts
|

Orders and Straight Left Orders in Completely Regular Semigroups

Abstract: A subsemigroup S of a completely regular semigroup Q is an order in Q if every element of Q can be written as a 5 b and as cd 5 where aY bY cY d P S and x 5 is the inverse of x P Q in a subgroup of Q. If only the ®rst condition holds and one insists also that a R b in Q, then S is said to be a straight left order in Q. This paper characterizes those semigroups that are straight left orders in completely regular semigroups. A consequence of this result, together with some technicalities concerning lifting of mo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
13
0

Year Published

2003
2003
2014
2014

Publication Types

Select...
4

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(13 citation statements)
references
References 8 publications
(12 reference statements)
0
13
0
Order By: Relevance
“…Theorem 5.5 of [15] (see also [17]) is the specialisation of Theorem 6.1 to the case where each S α is a straight left order in a completely simple semigroup T α . Surprisingly, the conditions in (A) are only slightly stronger than those in Theorem 5.5 of [15]. In the latter result one can use the decomposition of each S α as a matrix of right reversible cancellative subsemigroups to deduce that (≤ ℓ , ≤ r ) is a * -pair from the assumptions that ≤ ℓ and ≤ r are transistive, R ′ is a left congruence, L ′ ⊆ L * and R ′ ⊆ R * [15].…”
Section: Semilattices Of Straight Left Ordersmentioning
confidence: 99%
See 4 more Smart Citations
“…Theorem 5.5 of [15] (see also [17]) is the specialisation of Theorem 6.1 to the case where each S α is a straight left order in a completely simple semigroup T α . Surprisingly, the conditions in (A) are only slightly stronger than those in Theorem 5.5 of [15]. In the latter result one can use the decomposition of each S α as a matrix of right reversible cancellative subsemigroups to deduce that (≤ ℓ , ≤ r ) is a * -pair from the assumptions that ≤ ℓ and ≤ r are transistive, R ′ is a left congruence, L ′ ⊆ L * and R ′ ⊆ R * [15].…”
Section: Semilattices Of Straight Left Ordersmentioning
confidence: 99%
“…We remark here that if S is a left order in Q, H is a congruence on Q and Q is regular, then S is perforce straight [10]. Subsequently, a number of papers have appeared characterising semigroups that are (straight) left orders in semigroups in various classes, for example [12,15]. More recently, Theorem 4.4 of [14] gives a characterisation of straight left orders in arbitrary semigroups; we recap briefly below the approach of [14].…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations