In this dissertation.we mainly study the congruences onÏ€-regular semigroups with the kernel and the trace of congruences. Futher we apply our results to GV-semigroups and E-inversive semigroups. There are five chapters:In the first chapter , we give the introductions and preliminaries.In the second chapter ,we give the definition of the normal subset of aÏ€-regular semigroup S , the normal equivalence on E(S) and then we give the description of completely regular congruence pairs of S. The main results are given in follow:We represent the set of completely regular congruences on aÏ€-regular semigroup S by CRC(S) and the set of completely regular congruence pairs on aÏ€-regular semigroup S by CRCP(S).Definition 2.1.4 Let (K,ξ)∈CRCP(S) and define a binary relationÏ(K,ξ) on S bywhere r(a) = am,r(b) = bn.Theorem 2.1.15 Let (K,ξ)∈CRCP(S).ThenÏ(K,ξ)∈CRC(S) and KerÏ(K,ξ) =K,trÏ(K,ξ)=ξ.Conversely,ifÏ∈CRC(S), then (KerÏ,trÏ)∈CR.CP(S) andÏ=Ï(KerÏ,trÏ).Theorem 2.1.17 The mappings defined byare order preserving complete lattice isomorphisms and (?)1 =(?)2-1We represent the set of completely regular congruences on a GV-semigroup S by GVCRC(S) and the set of completely regular congruence pairs on a GV-semigroup S by GVCRCP(S). Definition 2.7.3 Let (K,ξ)∈GVCRCP(S) and define a binary relationÏ(K,ξ) on S bywhere r(a) = am.Theorem 2.7.4 Let (K,ξ)∈GVC RCP(S).ThenÏ(K,ξ)∈GVCRC(S) and KerÏ(K,ξ)=K,trÏ(K,ξ)=ξ.Conversely,ifÏ∈GVCRC(S), then (KerÏ, trÏ)∈GVCRCP(S) andÏ=Ï(KerÏ,trÏ).Theorem 2.7.5 The mappings defined byare order preserving complete lattice isomorphisms and (?) 1=(?)2-1.In the third chapter ,we mainly study the relation between a congruence on a GVsemigroupS and its trace on Sα.Theorem 3.2.1 LetÏbe a congruence on S and S/Ïbe a semilattice of nilextensionsof left groups. Then for arbitraryα∈Y,Sα/Ïαis a nil-extension of a left group,whereÏα=Ï| Sα.Theorem 3.2.6 LetÏαbe a congruence on Sαfor arbitraryα∈Y and Sα/Ïαis a nil-extension of a left group. ThenÏ= (∪Ïα )# is a congruence on S and S/Ïis a semilattice of nil-extensions of left groups.Theorem 3.3.10 Let v = {(e, f)∈E(S)×E(S) | eR*f}#. Then v is the smallest congruence on S such that S/v is a semilattice of nil-extensions of left groups.In chapter four,we give the definition of the normal subsemigroup of a semigroup S, the normal congruence on < E(S) > and then we give the description of rectangular group congruence pairs on S. The main results are given in follow:We represent the set of rectangular group congruences on an E-inversive semigroup S by ERCP(S) and the set of rectangular group congruence pairs on an E-inversive semigroup S by ERC(S).Definition 4.2.5 Let (K,ξ)∈ERCP(S) and define a binary relationÏ(K,ξ)on S by Theorem 4.2.6 Let (K,ξ)∈ERCP(S). ThenÏ(K,ξ)∈ERC(S) and KerÏ(K,ξ)= K,htrÏ(K,ξ) =ξ. Conversely,ifÏ∈ERC(S), then (KerÏ,htrÏ)∈ERCP(S) andÏ=Ï(KerÏ,htrÏ).Theorem 4.2.7 The mappings defined byare order preserving complete lattice isomorphisms and (?)1 =(?)2-1.In chapter five.we study the structure of B*-pure semigroups by denning a partial order.Theorem 5.2.5 The following conditions are equivalent:(1)S is a GV-inverse semigroup and S2 (?) RegS ;(2)S is a B*-pure semigroup;(3)S is a strong semilattice ofÏ€-groups and S2 (?) RegS.
|