1974
DOI: 10.1090/s0002-9947-1974-0357660-2
|View full text |Cite
|
Sign up to set email alerts
|

Groups, semilattices and inverse semigroups. I, II

Abstract: ABSTRACT. An inverse semigroup S is called proper if the equations ea = e = e2 together imply a2 = a for each a, e E S. In this paper a construction is given for a large class of proper inverse semigroups in terms of groups and partially ordered sets; the semigroups in this class are called /"-semigroups. It is shown that every inverse semigroup divides a P-semigroup in the sense that it is the image, under an idempotent separating homomorphism, of a full subsemigroup of a P-semigroup. Explicit divisions of th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

1985
1985
2011
2011

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 45 publications
(14 citation statements)
references
References 28 publications
0
14
0
Order By: Relevance
“…of an order ideal and subsemigroup of a semigroup which, in a sense, generalizes the construction of a P-semigroup, which has proved to be useful in describing inverse semigroups (McAlister [7], [8]), by replacing the group which acts on a semilattice by a completely simple semigroup. The homomorphism which arises in Pastijn's theorem is special in that the inverse image of each idempotent is a completely simple semigroup.…”
Section: Introductionmentioning
confidence: 99%
“…of an order ideal and subsemigroup of a semigroup which, in a sense, generalizes the construction of a P-semigroup, which has proved to be useful in describing inverse semigroups (McAlister [7], [8]), by replacing the group which acts on a semilattice by a completely simple semigroup. The homomorphism which arises in Pastijn's theorem is special in that the inverse image of each idempotent is a completely simple semigroup.…”
Section: Introductionmentioning
confidence: 99%
“…where is inclusion, P is E-unitary, and is a covering, that is, surjective and idempotent-separating; moreover, P= = G: So we have McAlister's Covering Theorem [24] that every inverse semigroup has an E-unitary cover. On the converse side, any covering : P !…”
Section: The Factorizable Part Of the Symmetric Inverse Monoidmentioning
confidence: 99%
“…The result is essentially due to Saitô. Our contribution is to simplify the algebraic structure by using the structure theorem for E-unitary inverse semigroups which was not available to him [7]. Proof.…”
Section: Conversely If S Is a Lexicographically Ordered E-unitary Inmentioning
confidence: 99%
“…Proof. The inverse semigroup S admits an E-unitary inverse cover P G E [7]. Let F be a free group which has G as a homomorphic image and induce an action of F on from that of G on .…”
Section: Covering Theorems and Green's Relationsmentioning
confidence: 99%