CHAPTER ONE

1.0Background of the Study

The main theme of this research is the equivalence relations known as Green’s relations on

semigroups introduced in 1951 by James Alexander Green. Green introduced five fundamental

equivalence relations (L, R, J, H, D) on semigroups. In this work these relations are applied to

inverse semigroups. In particular the study deliberates on Green’s relations on inverse

semigroups and finds the need to define Green’s equivalences relation on bicyclic semigroup.

Inverse semigroups are introduced independently by Wagner (1952) and Preston (1954). Ifx ∈ S,

where S is a semigroup, an element x ' is called an inverse of x if xx ' x =x and x ' xx ' =x '. In this

case x is also an inverse of x ' .

The study of the algebraic structure of bicyclic semigroup is of paramount importance to

semigroup theory. Although it is in fact a monoid, it is usually referred to as simply a semigroup.

There are at least three standard ways of constructing the bicyclic semigroup, and various

notations for referring to it. Lyapin (1953) called it P; Clifford and Preston (1967) used C; and

most recent papers have tended to use B. This work will use the modern style throughout. The

first published description of this object was given by Lyapin in 1953. Clifford and Preston claim

that one of them, working with Rees, discovered it independently (without publication) at some

point before 1943.

Previously O’ Hara (2015), had studied Green’s relation on algebraic semigroups; in which he

enhanced the understanding of regular algebraic semigroups by considering the structural

influence of Green’s relations. To achieve this, he considered three chief topics:

1
(i) Green’s relations and the adherence order on reductive monoids

(ii) Renner’s conjecture on regular irreducible semigroups with zero and

(iii) A Green’s relation inspired construction of regular algebraic semigroups.

Harisprakash (2016), also studied Green’s relation on Fuzzy semigroup; and he redefined

Green’s relations to fuzziness property of semigroup and Xavier (2010), generalized inverse

semigroup and Green’s relations; where she first defined the notion of inverse along an element

and studied its properties, she then showed that the classical generalized inverses (group inverse,

Drazin inverse and Moore-Penrose inverse) belong to this class. Hence in our own case, we shall

apply the Green’s relations to inverse semigroups, particularly the bicyclic semigroup.

1.1 Definitions and Basic Concepts

Definition 1.1 [Jacobson, 1951] A semigroup is an algebraic structure which is closed and

whose operation is associative.

Definition 1.2 [Howie, 1995] A monoidM is a semigroup with an identity, i.e. there exists1 ∈ M,

such that 1 a=a=a1 for all a ∈ M .

Definition 1.3 [Howie, 1995] Let S , Tbe semigroups then θ :S →T is a semigroup (homo)

morphism if, for all, b ∈ S ,(ab)θ=aθbθ.

If S , Tare monoids then θ is a monoid (homo) morphism if θ is a semigroup morphism and

1S θ=1T .

Definition 1.4 [Howie 1995] For a semigroup S, define the semigroup S1 as,

S1=
{S ∪ S{1,}if, otherwise
1∈ S

2
1 s=s 1=s ∀ s ∈ S .

The advantage of S1 is that unlike an ideal such as, aS, we can guarantee that a ∈. Green’s

relations on semigroups are defined in terms of ideals by using S1.

Definition 1.5 [Aleksandra, 2000] Let S be a semigroup. A non-empty subset A of S is called a

left ideal of S if SA ⊆ A,i. e . ∀ sϵS, aϵA , saϵA. Dually A is called a right ideal of S if AS ⊆ A,

i. e . ∀ sϵS, aϵA , asϵA. If A is both left and right ideal then A is two sided ideal of S.

Definition 1.6 [Brion, 2012] An idempotent of a semigroup S is an element e ∈ S such that

e 2=e . We denote by E(s) the set of idempotents. We put E(s) = {e ∈ S | e2 = e}.

Definition 1.7 [Howie, 1995] Let S be a semigroup and ∅ ≠T ⊆ S. Then T is a subsemigroup of S

if ∀ a , b ∈T ⇒ ab ∈T . If S is a monoid then T is a submonoid of S if T is a subsemigroup and 1 ∈

T.

Definition 1.8 [Howie, 1995] A regular semigroup is a semigroup S in which every element is

regular, i.e., for each element x ∈ S ,there exist an element a ∈ Ssuch that xax=x .

Definition 1.9 [Howie, 1995] If ρ is a relation on a semigroup S then we say that ρ is left

compatible if for everya , b , c ∈ S, if aρb then caρcb. Similarly we defined right compatible

relations as for everya , b , c ∈ S, if aρb then acρbc. A left (right) compatible equivalence relation

is a left (right) congruence.

Definition 1.10 [Howie, 1995] A relation ρ on a set X is called an equivalence relation if;

(i) ρ is reflexive on X, i. e . ( x , x ) ∈ ρ , xϵX.

(ii) ρ is symmetric on X, i. e , ( x , y ) ∈ ρ⟹ ( y , x ) ∈ ρ , ∀ x , y ϵ X.

(iii) ρis transitive on X, i. e . ρ x , y , z ϵ X , ( x , y ) ∈ ρ∧( y , z ) ∈ ρ ⟹ ( x , z ) ∈ ρ

3
Definition 1.11 (Howie, 1995) A semigroup S is periodic if each element x ∈ S has a power

which is idempotent. That is there exist m∈ N such that x m is idempotent i.e.

( x m )(x m)=x m ⟹ x2 m =x m

2.0 Green’s relation

A semigroup S is a set together with an associated binary operation. A semigroup S without an

identity element is written as S1. We introduced the various Green’s relation on a semigroup S,

then by the L-class of a we mean the set of all elements of S which generate the same principal

left ideal as generated by a and is denoted by La. In other words an element b of S is in L-class

Lb of b if and only if S1 a=S 1 b . R-class (right class ) are define in the dual manner and are

denoted by Ra, Rb, … etc., i.e., b ∈ Ra if and only if aS 1=bS 1 . Also, we write b ∈ La as aLb and

b ∈ Ra as aRb . We observed that L is a right congruence on S while R is a left congruence on S.

The smallest equivalence relation containing both L and R is denoted by D and it can be shown

thatD=L ∘ R=R ∘ L.

Also a L-class and a R-class of a semigroup S meet only when both are contained in a particular

D-class. We define H=L ∩ R and clearly H is an equivalence relation. Two elements a, b in S

are said to be J equivalence if they generate the same principal ideal i.e, if S1 a S 1=S1 bS1 . We

then write aJb or b ∈ Ja . The five relations L, R, D, H and J are due to Green and called Green’s

relations in an arbitrary semigroup.

Definition 2.1 [Green, 1951] Let S be a semigroup. (i) Define a relation L on S by a L b if and

only if either a=b or there exist x , y ∈S1 such that xa=b and yb=a. (a , b) ϵ L, therefore a and

b are L related.

(ii) Define a relation R on S by a R b if and only if either a=b or there existu , v ∈S1 such that
4
au=b and bv=a. (a , b)∈R, therefore a and b are R related.

(iii) Define a relation J on S by a J b if and only if either a=b or there exist x , y , u , v ∈S1 such

that xay=b and ub v =a. (a , b)∈J, therefore a and b are J related. Now L, R, and J, are all

equivalence relations on S. The remaining relations are derived from L and R. The intersection L

∩R= H . Then H is an equivalence. So aH b if and only if a L b and a R b. This is also an

equivalence relation on S. Finally D is defined as aD b if and only if either a=b or there exist

cϵSsuch that a L c and c R b. Then D = L o R.

Definition 2.2 (Global) Let S be an arbitrary given semigroup. We define the Green’s relations

on S globally; L, R, J, H, and D as follows. For any two elementsa , b ∈ S.

aLb if and only if S1 a=S 1 b

aRb if and only if a S1=b S 1

aJb if and only if S1 a S 1=S1 b S 1

aH b if and only if aR b and aL b

aD b if and only if there exist c ∈ S such that aLc and cRb.

3.0Inverse semigroup

The inverse of an element a of an inverse semigroup S is usually writtena−1. Inverse in an

inverse semigroup have many of the same properties as inverse in a group, for example

(ab)−1 =b−1 a−1 .In an inverse monoid, x x −1 and x−1 x are not necessarily equal to the identity,

but they are both idempotent. An inverse monoid S in which x x −1 =1=x−1 x , for all x in S.

There are a number of equivalent characterizations of an inverse semigroup S;

5
1) Every element of S has a unique inverse in the above sense.

2) Every element of S has at least one inverse (S is a regular semigroup) and idempotents

commutes (i.e. the idempotents of S form a semi lattice).

3) Every L-class and every R-class contains precisely one idempotent, where L and R are two of

Green’s relations.

The idempotent in the L-class of S is S S 1 while the idempotent in the R-class of S is S1 S .

Therefore a simple characterization of Green’s relation in an inverse semigroup.

aLb ⇔ a−1 a=b−1 b ,

aRb ⟺ a a−1=b b−1

Unless state otherwise, E(S) will denote the semilattice of idempotents of an inverse semigroup

S.

Definition 3.1 [Harju, 1996]. A semigroup S is called an inverse semigroup if each x ∈ S has a

unique inverse element x−1 : x=x x −1 x and x−1=x−1 x x−1

Examples of inverse semigroups:

(i) If X is a set and β ¿) is the collection of homogeneous relation (Relation between

elements of the same set are called homogeneous(Gerick , 1963)) on X with

composition of relation as binary operation, then β (X ) forms an inverse semigoup

since each relation has a converse relation which serves as an inverse.

(ii) Every group is an inverse semigroup.

(iii) The bicyclic semigroup is an inverse semigroup, with (a , b)−1=(b , a).

(iv) Every semilattice is inverse.

6
 (v) The Brandt semigroup is inverse.

(vi) The Munn semigroup is inverse.

4.0 Bicyclic semigroup

The bicyclic semigroup/monoid B, is one of the most fundamental semigroups, with many

remarkable properties and generalizations. There are at least three standard ways of constructing

the bicyclic semigroup, and various notations for referring to it. Lyapin called it P; Clifford and

Preston used C; and most recent papers have tended to use B . This work will use the modern

style throughout.

1) One of the realizations is the bicyclic semigroup B is the monoid generated by { a , b } with the

single relationab=1. The elements of B are all words of the form a n b m for m , n≥ 0 (with the

understandinga 0=b0 =1). These words are multiplied as follows.

n+k−m l
a n b m ak bl= a n l+m−k
b if m≤ k .
{
a b if m≥ k .

It is apparent that B is simple, for if a n b m is an element of B then

S1 an bm S 1=S .

It is also easy to see that B is an inverse semigroup, the element a n b m has inverse a m b n . It is

useful to picture some further properties of B by arranging the elements in a table:

b b2 b3 b4 . . .

1
a ab a b2 a b3 a b4 . . .
a2 a2b a 2 b2 a 2 b3 a2b4 .. .
a3 a3b a3b2 a3b3 a3b4 . . .
a4 a4 b a 4 b2 a 4 b3 a 4 b4 . . .

7
 . . . . . .
. . . . . .
. . . . . .

Figure 1.

Then the elements below any horizontal line drawn through this table form a right ideal and the

elements to the right of vertical form a line left ideal. Further the elements on the diagonal are all

idempotents and their standard ordering is

1>ab> a2 b2 >a3 b3 >. . .

2) The other realization is that bicyclic semigroup is the free semigroup on two generators a and

b , under the relation ab=1. That is, each semigroup element is a string of those two letters, with

the proviso that the subsequence “a b” does not appear. The semigroup operation is

concatenation of strings, which is clearly associative. It can then be shown that all element of B

in fact have the formq a p b, for some natural numbers a and b. The composition operation

simplifies to

(q a p b)(qc p d )=q a+c−min ⁡{b , c} pd +b−min ⁡{b , c}

It is apparent that B is simple, for if q a p b is an element of B, then S1 qa pb S 1=S . It is also easy

to see that B is an inverse semigroup: the element q a p b has inverseq b p a.

3) The third realizations of bicyclic semigroup is the Cartesian square N 0 × N 0, where N 0 is the

set of non-negative integers, with respect to the operation.

( a , b )( c , d )=( a+ c−min ( b , c ) ,b +d−min ( b ,c ) )

8
This is sufficient to define B so that it is the same object as in the original construction. Just as a

and b generated the B originally, with the empty string as the monoid, this new construction of B

has two generators ( 1,0 ) and( 0,1 ) , with identity( 0,0 ) .

The egg box diagram for B is infinitely large; upper left corner begins:

( 0,0 ) ( 1,0 ) ( 2,0 )( 3,0 )( 4,0 )( 5,0 )( 6,0 ) ( 7,0 ) …

( 0,1 ) ( 1,1 )( 2,1 ) ( 3,1 )( 4,1 )( 5,1 ) ( 6,1 )( 7,1 ) …

( 0,2 ) ( 1,2 )( 2,2 ) ( 3,2 )( 4,2 )( 5,2 ) ( 6,2 )( 7,2 ) …

( 0,3 ) ( 3,1 )( 3,2 ) ( 3,3 ) ( 4,3 ) ( 5,3 ) ( 6,3 )( 7,3 ) …

( 0,4 )( 1,4 )( 2,4 ) (3,4 ) ( 4,4 )( 5,4 )( 6,4 )( 7,4 ) …

( 0,5 ) ( 1,5 ) ( 2,5 )( 3,5 )( 4,5 )( 5,5 ) ( 6,5 ) ( 7,5 ) …

( 0,6 )( 1,6 ) ( 2,6 ) ( 3,6 ) ( 4,6 ) ( 5,6 ) ( 6,6 ) ( 7,6 ) …

( 0,7 )( 1,7 ) ( 2,7 ) ( 3,7 ) ( 4,7 )( 5,7 ) ( 6,7 ) ( 7,7 ) …

⋮ ⋮⋮ ⋮⋮ ⋮⋮ ⋮ ⋱

Figure 2.

Each entry represents a singleton H-class; the rows are the R-class and the columns are the L-

class. The idempotents of B appear down the diagonal, in accordance with the fact that in a

regular semigroup with commuting idempotents, each L-class and each R-class must contain

exactly one idempotent.

9
For example ( Z , max) where max (a , b)=max {a , b } is a semigroup and ( N 0 , max) is a monoid.

Put B=N 0 × N 0 . On B we can also define a ‘binary operation’ by

(a , b)(c , d)=(a−b+ t , d−c+t ),

wheret=max {b , c }.

Definition 4.1 (Howie, 1995): A semigroup which is generated by a single element is called a

cyclic semigroup.

Let S= ⟨ a ⟩ be a cyclic semigroup. Then as a set, S= { an ∨n>0 } .

Definition 4.2 [Clifford and Preston, 1961] The Bicyclic semigroup is the semigroup with unit

element 1 and two generators a , b subject to the single generating relation ab=1.

Definition 4.3 [Howie, 1995] Brandt semigroup are completely 0-simple inverse semigroups. In

other words, they are semigroup without proper ideals and which are also inverse semigroups.

They are built in the same way as completely 0-simple semigroup. Let G be a group and I, J be

non empty sets. Define a matrix P of dimension ¿ I ∨×∨J∨¿ with entries in G0=G ∪ {0 }. Then,

it can be shown that every 0-simple semigroup is of the form

S=( I × G0 × J ) with the operation ( I ,a , j)(k ,b , n)=( I , ap jk b ,n).

As Brandt semigroup are also inverse semigroup, the construction is more specialized and in

fact, I =J. Thus, a Brandt semigroup has the form

S=( I × G0 × J ) with the operation ( I ,a , j)(k ,b , n)=(I , a p jk b , n).

DEFINITION 4.4 [Howie, 1995] The Munn semigroup is the inverse semigroup of

isomorphism between principal ideals of a semi-lattice (a commutative semigroup of

10
idempotents). Example; Let N 0={0,1,2 , …} . Then N 0 is a semilattice under the usual ordering of

the positive integers(0<1< 2< …). The principal ideals of N 0 are then N 0 n={0,1,2 , … ,n } for alln

. So, the principal ideals N 0 m and N 0 n are isomorphic if and only ifm=n.

5.0 Green’s Relations on a Fuzzy Semigroup

Green introduced five fundamental equivalence relations on semigroup. With the help of Green’s

relations a semigroup structure can be described by introducing fuzziness property on semigroup,

Green’s relations can be redefined as follow:

Definition 5.1 [Harisprakash, 2016] membership function can be defined as a technique to

solve practical problems by experience rather than knowledge.

Definition 5.2 [Harisprakash, 2016] LetS be a fuzzy semigroup with membership function A

defined on it. Green’s L-relation on S is defined by

L¿ {(a , b)∈ S × S :S 1 a=S1 b∧ A ( xa)= A ( xb ) ∀ x ∈ S }

L( a , b )=zmax
,w ∈S
min { min [ A ( za ) , A ( wb ) }

Green’s R-relation on S is defined by

R¿ {(a , b)∈ S × S :a S 1=b S1∧ A (ax)=A (bx ) ∀ x ∈ S }.

6.0 Statement of the problem

Many researchers have studied the Green’s relations via various types of semigroups. For

instance: Xavier (2010) generalized inverse semigroup and Green’s relations where she first

define the notion of inverse along an element and studied its properties then she showed that the

11
classical generalized inverses (group inverse, Drazin inverse and Moore-Penrose inverse) belong

to the class.

O’ Hara (2015) studied Green’s relations on algebraic semigroup in which he enhanced the

understanding of regular algebraic semigroups by considering the structural influence of Green’s

relations. To achieve this, he considered three chief topics: (i) Green’s relations and the

Adherence order on reductive monoids, (ii) Renner’s conjecture on regular irreducible

semigroups with zero and (iii) a Green’s relation inspired construction of regular algebraic

semigroups. And recently Harisprakash (2016) studied Green’s relation on Fuzzy semigroup

where he redefined Green’s relations to fuzziness property of semigroup. Hence in this work, the

study will apply the Green’s relations to the bicyclic semigroups.

7.0 Objectives of the study

The objectives of the study are to:

(i) apply Green’s relation on Sub-semigroups of bicyclic semigroups,

(ii) apply Green’s relation on ideals in bicyclic semigroups, and

(iii) apply Green’s relation on the set of idempotents in bicyclic semigroups.

8.0 Scopes and Limitation

In view of the fact that Green’s relations have wide range of applications; this study is limited to

the study of Green’s relations on bicyclic semigroups.

9.0 Significance of the study

12
The bicyclic semigroups form an important class of inverse semigroups. Applying the Green’s

relations to the bicyclic semigroup will open the door for application to some other types of

inverse semigroups, leading to possible comparative analysis.

CHAPTER TWO

Literature review

Harisprakash (2016) studied Green’s relation on Fuzzy semigroup; he redefined Green’s

relations to fuzziness property of semigroup. Kar-ping et al (2010), Green’s relations and their

Generalization on semigroups: In his paper, he first gave a brief survey of his topic. He then gave

13
some examples to illustrate some special properties of generalized Green’s relations which are

related to completely regular semigroups and abundant semigroups.

Lukas et al (2017), worked on Green’s relations in finite transformation semigroups where

they consider the complexity of Green’s relations when the semigroup is given by transformation

on a finite set then the equivalence classes is in the same order of magnitude as the number of

elements. O’ Hara (2015) studied Green’s relations on algebraic semigroups in which he

enhanced the understanding of regular algebraic semigroups by considering the structural

influence of Green’s relations. To achieve this, he considered three chief topics:

i. Green’s relations and the Adherence order on reductive monoids,

ii. Renner’s conjecture on regular irreducible semigroups with zero and

iii. a Green’s relation inspired construction of regular algebraic semigroups.

Niovi (2006),worked on ideals and Green’s relations in ordered semigroups where he

proved that if (S,·,≤) is a nil ordered semigroup which is a chain with respect to the divisibility

ordering, then every complete congruence on S is a Rees congruence. Furthermore, the ideals of

a nil ordered semigroup S form a chain under inclusion if and only if S is a chain with respect to

the divisibility ordering.

Margolis and Benjamin (2002), constructed the freest idempotent-pure expansion of an inverse

semigroup, generalizing an expansion of Margolis and Meakin for the group case. They also

generalize the Birget-Rhodes prefix expansion to inverse semigroups with an application to

partial actions of inverse semigroups. In the process of generalizing the latter expansion, they

had led to a new class of idempotent-pure homomorphism which they term F-morphisms.

14
Amlan (2016), Made a study on inverse ordered semigroups; He has shown that a completely

regular ordered semigroup is Clifford (left) if and only if it is (left) inverse. Furthermore he

observed that a left inverse ordered semigroup is complete semi lattice of left group like ordered

semigroups if and only if L = R.

Harinath (1976), On a generalization of inverse semigroups. In his paper, the notion of a regular

semigroup in which each element possesses a unique left or right unit is introduced and a few of

its salient features are examined. Christopher (2010), three approaches to inverse semigroups.

He give a historical survey of the three main approaches to the study of the structure of inverse

semigroups. The second concerns the notion of a fundamental inverse semigroup and its Munn

representation. Finally, the third centers upon the concept of an E-unitary or proper inverse

semigroup and its representation (due to McAlister) by a so-called P-semigroup.

Descalco and Higgins (2010), Generalized Green’s Equivalences on the subsemigroup of the

monoid; they studied generalized Green’s equivalences on all subsemigroups of the bicyclic

monoid B and determine the abundant (and adequate) subsemigroups of B.

Ehrenfeut, et al (1993), proved that if S and R are two permutable transitive subsemigroups of

Tzx , i.e. they commute elementwise, afl=fla for alla ∈ S , fl ∈ R, and then they are simply

transitive groups of permutations and centralizers of each other.

East, et al (2019), used a variant of schreire’s theorem and theory of Green’s relations to show

how to reduce the computation of an arbitrary subsemigroup of finite regular semigroup to that

of certain associated subgroups.

The notion of a Γ-semigroup has been introduced in the year 1981. Chinram and Siammai

(2008), consider Green’s relations for Γ-semigroups and reductive Γ-semigroups.

15
Xavier (2010) had also generalized inverse semigroup and Green’s relations where she first

define the notion of inverse along an element and studied its properties then she showed that the

classical generalized inverses (group inverse, Drazin inverse and Moore-Penrose inverse) belong

to the class.

There exist many specific generalized inverses in the literature, such as the group inverse, the

Drazing inverse or the Moore Penrose inverse. Necessary and sufficient conditions for the

existence of such inverses are known as are their properties. If one looks carefully at these

results, it appears that these existence criteria all involve Green’s relation and that all inverses

have double commuting properties. So, one may wonder whether we could unify this different

notion of invertibility. In this article we propose to define a new type of generalized inverse, the

inverse along an elements that is based on Green’s relations L, R, J, H, and D and associated

preorders. It appears that this notion encompass the classical generalized inverses but is of richer

type. By deriving general existence criteria and properties of this inverse, we will then recover

directly the classical results. The framework is the one of semigroups, hence the results are

directly applicable in rings or algebras where generalized inverses are highly studied.

Brion (2012), has present some fundamental results on (possibly nonlinear) algebraic semigroups

and monoids. These include a version of Chevalley’s structure theorem for irreducible algebraic

monoids, and the description of all algebraic semigroup structures on curves and complete

varieties. Kenneth (1989), worked in the literature of ideals as a left ideal L of a system S has

usually been defined by the inclusion SL⊆ L and a right ideal R by the inclusion RS ⊆ R. On the

other hand a left zero element z is usually defined by the equation za=z and a right zero element

by the equation az=z , similarly a left or right identity element e is defined by the equation

ea=a or ae=a respectively.

16
 The study of semigroups trailed behind that of other algebraic structure with more

complex axioms such as groups or rings. A number of sources attribute the first use of the term

(in front) to Green. de seguier in Elements de la theorie des GroupesAbstraits (Elements of the

theory of Abstracts Groups) in 1904. The term is used in English in 1908 in Hinton’s Theory of

Groups of finite order. Suschkewitch obtained the first non-trivial results about semigroups. His

1928 paper “uber die endlichenGruppenohne das Gesetz der eindeutigenumkehrbarkeit” (“on

finite groups without the rule of unique invertibility”) determined the structure of finite simple

semigroups and showed that the minimal ideal (or Green’s relation J-class) of a finite semigroup

is simple. From that point on, the foundations of semigroup theory were further laid by Rees,

Green, Lyapin, Alfred, Clifford and Gordon Preston. The latter two published a two volume

monograph on semigroup theory in 1961 and 1967 respectively. In 1970, a new periodical called

semigroup forum (currently edited by Springer) became one of the few Mathematical journals

devoted entirely to semigroup theory. In recent years researchers in the field have become more

specialized with dedicated monographs appearing on important classes of semigroups like

inverse semigroups.

CHAPTER THREE

Methodology

We shall consult books, proceeding of conferences and journals to obtain literature relevant to

the study. The approach of Harisprakash and Allen’ O. Hara, will be use to explore the

17
comprehensive study of Green’s relations on inverse semigroups, particularly the bicyclic

semigroup.

Corollary 1: (Howie, 1995) Two elements c i b j , c k bl ( j≤ l) in a subsemigroup S of B are L-

related if and only if

c k bl x=c k bl y ⇒ c i b j x =c i b j y , ∀ x , y ∈ S1 .

Corollary 2: (Howie, 1995) Let S be a regular semigroup andx , y ∈ S. Then

(1) xL y ↔Sx = Syand

(2) xRy ↔ xS= yS

Lemma 1: (Howie, 1995) suppose ef =fe for allf ,e ∈ E(s). Then E(s)=∅ or E(s) is a

subsemigroup.

Lemma 2: (Harju, 1996). S is simple if and only if S=SxS for all x ∈ S.

Proposition 1: (O’Hara, 2015) if S is a regular semigroup then for all x ∈ S , S1 x S1 =SxS .

Proposition 2: (Howie, 1995) If S is a periodic semigroup then J = D.

Proposition 3: (Howie, 2015) Let S be an inverse semigroup with semi-lattices E of

idempotents. Then; (1) (ab)−1 =b−1 a−1 for every a , b ϵS

(2) both ae a−1 and a−1 ea are idempotent for every aϵS, and eϵE.

(3) aLb if and only a−1 a=b−1 b ; aRb if and only if a a−1=b b−1 .

(4) if e , f ∈ E, then eDf if and only if there exist a ∈ S such that a a−1=e and a−1 a=f .

Proposition 4: (Howie, 1995) B is a monoid with identity (0,0).

18
Theorem 1: (Howie, 1995) (Inverse Semigroup Theorem). A semigroup S is inverse in S is

regular and E(s) is a semilattices(i .e . ef =fe ∀ e , f ∈ E(S)).

Theorem 2: (Howie, 1995) A semigroup S is regular if and only if each L- class and R-class

contains an idempotent.

Theorem 3: (Howie, 1995) A semigroup S is inverse if and only if each L- and R-class contain a

unique idempotent.

Theorem 4: (Howie 1995) Let S be an inverse semigroup and let x , y ∈ S

(1) xL yif and only if x−1 x = y−1 y

(2) xR yif and only if x x −1 = y y −1 ,

where L and R are Green’s relations.

Theorem 5: (Howie, 1995) Let S be a semigroup. Then the following statements are equivalent:

(1) S is regular,

(2) Every L-class of S contains at least one idempotent,

(3) Every R-class of S contains at least one idempotent and

(4) Every D-class of S contains at least one idempotent.

CHAPTER FOUR

Results and discussion

19
In this chapter we finalize the study of Green’s relations on inverse semigroup by showing some

results gotten from our chapter three of this work. Consider the examples of bicyclic semigroup.

Construction: There are at least three (but we used only two) standard ways of constructing the

bicyclic semigroup and various notations for referring to it.

1) The bicyclic semigroup B is the monoid generated by { a , b } with the single relationab=1. The

elements of B are all words of the form a n b m for m , n≥ 0 (with the understandinga 0=b0 =1).

These words are multiplied as follows:

n+k−m l
a n b m ak bl= a n l+m−k
b if m≤ k . … … … … …
{ a b if m≥ k .
Equation (1)

It is apparent that B is simple, for if a n b m is an element of B then

S1 an bm S 1=S .

It is also easy to see that B is an inverse semigroup, the element a n b m has inverse a m b n . It is

useful to picture some further properties of B by arranging the elements in a table:

1 b b2 b3 b4 . . .
a ab a b2 a b3 a b4 . . .
a2 a2b a 2 b2 a 2 b3 a2b4 .. .
a3 a3b a3b2 a3b3 a3b4 . . .
a4 a4 b a 4 b2 a 4 b3 a 4 b4 . . .

20
 . . . . . .
. . . . . .
. . . . . .

Figure 1.

Then the elements below any horizontal line drawn through this table form a right ideal and the

elements to the right of vertical form a line left ideal. Further the element on the diagonal are all

idempotents.

EXAMPLE 1; Leta 2 b 4 has an inverse a 4 b2

( a 2 b 4 ) ( a 4 b2 ) ( a2 b4 )=( a 2 b 2+4 −4 ) ( a2 b4 )=( a2 b 2 )( a2 b 4 ) =( a2 b 4+2−2 )= ( a2 b4 )And

( a 4 b2 ) ( a2 b 4 ) ( a4 b 2 )=( a 4 b4 +2−2 ) ( a4 b 2 )=( a4 b4 )( a4 b 2) =( a 4 b2+ 4−4 ) =( a 4 b2 )

EXAMPLE 2; Leta 2 b3 has an inverse a 3 b 2

( a 2 b 3 )( a3 b2 ) ( a2 b3 )= ( a2 b2+3 −3 ) ( a2 b 3 )=( a2 b 2 )( a2 b3 )=( a2 b3+2−2 )= ( a2 b3 )And

( a 3 b 2 )( a2 b3 ) ( a3 b2 )= ( a3 b3 +2−2) ( a3 b 2 )=( a3 b 3 )( a3 b2 )=( a3 b2+3 −3 ) =( a 3 b 2)

Result 1; The bicyclic semigroup B is an inverse semigroup, with the element a n b m has inverse

a n b m.

Proof: using the operation in ( 1 )

( a n b m ) ( am b n )( an bm ) =( an b n+m−m ) ( a n b m )=( an bn ) ( a n b m )=an bm+ n−n=an b m

and

( a m bn ) ( an bm )( am bn ) =( am b m+n−n ) ( a m bn )=( am bm ) ( am bn ) =am bn +m−m=am bn

21
Thus a n b m is an inverse of a n b m.

Therefore every element of Figure 1 has a unique inverse.

The characterization of Green’s relation

EXAMPLE 3: The elements to the right of any vertical line form a left relation L on the Figure

Pick any two elements, say a 3 b 2 and a 4 b2 are L related

Therefore a 3 b 2 has an inverse a 2 b3 a 4 b2 has an inverse a 2 b 4By theorem (4)

a 3 b 2 L a 4 b2 ⟹ ( a2 b 3 )( a3 b2 )=( a2 b4 ) ( a4 b2 )

a 2 b2 +3−3=a 2 b2 +4−4

a 2 b2 =a2 b2

The elements below any horizontal line form a right relation R. Choose two elements as;

a 3 b 2∧a3 b5

( a 3 b 2 )( a2 b3 )=( a3 b5 ) ( a5 b3 )

a 3 b 3+2−2=a3 b3 +5−5

a 3 b 3=a3 b3

Result 2; Show that bicyclic semigroup B is L ,R and D related.

Proof: The elements to the right of any vertical line form a left relation L on the Fig.1

Let the elements a n b m and a l b m are L related

22
Therefore a n b m has an inverse a m b n al bm has an inverse ambl

By theorem (4).

a n b m L a l b m ⟹ ( a m bn ) ( an bm )=( a m bl ) ( al bm )

a m b m+n −n =am b m+l−l

a m b m=am bm

Hence a m b n is L related toa l b m.

The elements below any horizontal line form a right relation R.

Chosen any two elements,a x b y ∧a x b z

a x b y Ra x bz ⇒ ( a x b y ) ( a y b x )= ( a x b z ) ( a z b x )

a x bx + y− y =a x b x+ z− z

a x bx =a x b x

Hence a x b y is R related to a x bz .

By definition aDb if and only if a=b or there exist c ∈B such that aLc and cRb. We can say an

elements a 3 b 2Da 4 b5if and only if there exist a 4 b2 ∈B such that

2 3 3 2 2 4 4 2
a 3 b 2La 4 b2 ⟺( a b )(a b )=(a b )(a b )

a 2+3−3 b 2=a 2+4− 4 b 2

a 2 b2 =a2 b2

4 2 2 4 4 5 5 4
a 4 b2Ra 4 b5 ⟺( a b )(a b )=(a b )(a b )

23
a 4+2−2 b4 =a 4+5−5 b 4

a 4 b4 =a 4 b 4

Therefore the elements a 3 b 2 and a 4 b5 are D related.

2) From ordered pairs

The way in which these exponents are constrained suggests that the “a and b structure” can be

discarded, leaving only operations on the “m and n” part. Bicyclic semigroup is the Cartesian

square N 0 × N 0, where N 0 is the set of non-negative integers. So B is the semigroup of pairs of

natural numbers ( including zero) with the operation.

( a , b )( c , d )=( a+ c−min { b . c } ,d +b−min {b , c } )

This is sufficient to define B so that it is the same object as in the original construction. Just as a

and b generated the B originally, with the empty string as the monoid, this new construction of B

has two generators ( 1,0 ) and ( 0,1 ) , with identity ( 0,0 ) .

The egg box diagram for B is infinitely large; upper left corner begins:

( 0,0 ) ( 1,0 ) ( 2,0 )( 3,0 )( 4,0 )( 5,0 )( 6,0 ) ( 7,0 ) …

( 0,1 ) ( 1,1 )( 2,1 ) ( 3,1 )( 4,1 )( 5,1 ) ( 6,1 )( 7,1 ) …

( 0,2 ) ( 1,2 )( 2,2 ) ( 3,2 )( 4,2 )( 5,2 ) ( 6,2 )( 7,2 ) …

( 0,3 ) ( 3,1 )( 3,2 ) ( 3,3 ) ( 4,3 ) ( 5,3 ) ( 6,3 )( 7,3 ) …

( 0,4 )( 1,4 )( 2,4 ) (3,4 ) ( 4,4 )( 5,4 )( 6,4 )( 7,4 ) …

( 0,5 ) ( 1,5 ) ( 2,5 )( 3,5 )( 4,5 )( 5,5 ) ( 6,5 ) ( 7,5 ) …

24
( 0,6 )( 1,6 ) ( 2,6 ) ( 3,6 ) ( 4,6 ) ( 5,6 ) ( 6,6 ) ( 7,6 ) …

( 0,7 )( 1,7 ) ( 2,7 ) ( 3,7 ) ( 4,7 )( 5,7 ) ( 6,7 ) ( 7,7 ) …

⋮ ⋮⋮ ⋮⋮ ⋮⋮ ⋮ ⋱

Figure 2.

Each entry represents a singleton H-class; the rows are the R-class and the columns are the L-

class. The idempotents of B appear down the diagonal, in accordance with the fact that in a

regular semigroup with commuting idempotents, each L-class and each R-class must contain

exactly one idempotent.

Example 4; let ( 2,3 ) be an element of B and ( 3,2 ) be its inverse.

By the definition of inverse

( 2,3 ) ( 3,2 )( 2,3 )=( 2+3−min { 3,3 } ,3+2−min { 3,3 } ) ( 2,3 )

¿ ( 2+3−3 ,3+2−3 ) ( 2,3 )

¿ ( 2,2 ) ( 2,3 )

¿ ( 2+2−min { 2,2 } , 2+3−min { 2,2 } )

¿ ( 2+2−2 , 2+3−2 )

¿ ( 2,3 ) and

( 3,2 ) ( 2,3 )( 3,2 ) =( 3+2−min {2,2 } , 2+3−min {2,2 }) ( 3.2 )

¿ ( 3+2−2, 2+3−2 )( 3,2 )

¿ ( 3,3 ) ( 3,2 )

25
 ¿ ( 3+3−min { 3,3 } ,3+ 2−min { 3,3 } )

¿ ( 3+3−3 ,3+ 2−3 )

¿ ( 3,2 )

Result: the bicyclic semigroup B is inverse with ( a , b )−1=( b , a ) .

Proof : from fig. 2

( a , b )( b , a ) ( a , b ) =( a+ b−min {b ,b } , b+ a−min { b ,b } ) ( a , b )

¿ ( a+ b−b ,b+ a−b ) ( a , b )

¿ ( a , a) ( a , b)

¿ ( a+ a−min { a , a } , a+b−min { a , a } )

¿ ( a+ a−a ,a+ b−a )

¿ ( a , b ) and

( b , a )( a , b ) ( b , a ) =( b+ a−min {a ,a } , a+ b−min { a , a } ) ( b , a )

¿ ( b+ a−a ,a+ b−a ) ( b , a )

¿ ( b , b) ( b , a)

¿ ( b+ b−min { b ,b } ,b +a−min { b , b } )

¿ ( b+ b−b ,b+ a−b )

¿ (b , a)

The characterization of Green’s relations

26
Example 5; An elements (4,2) and (4,8) are R related,

Therefore element (4,2) has an inverse (2,4) and (4,8) has an inverse (8,4).

By theorem 4, (4, 2) R (4, 8) if and only if ( 4,2 )( 2,4 )=( 4,8 )( 8,4 )

( 4+2−min { 2,2 } , 2+ 4−min {2,2 }) =( 4+8−min { 8,8 } , 8+4−min {8,8 } )

( 4 +2−2, 2+4−2 )=( 4 +8−8 , 8+4−8 )

( 4,4 )=( 4,4 )

Hence (4,2) is R related to(4,8)

Example 6; An element (6, 3) is L related to (10,3),

since (3,6) is an inverse of (6,3)

(3,10) is an inverse of (10,3)

By theorem 4. (6, 3) L (10,3) if and only if ( 3,6 ) ( 6,3 )= (3,10 )( 10,3 )

( 3+6−min {6,6 } , 6+3−min { 6,6 } ) =( 3+10−min { 10,10 } ,10+3−min { 10,10 } )

( 3+6−6 , 6+3−6 ) =( 3+10−10 , 10+3−10 )

( 3,3 )= ( 3,3 )

Hence (6,3) and (10,3) are L related.

Result: show that bicyclic semigroup B is L , R and D related.

Proof: the elements (a,b) and (t,b) are L related

( a , b ) L ( t , b ) ⟹ ( b , a )( a ,b )=( b , t )( t ,b )

27
( b+ a−min { a , a } , a+b−min { a , a } )= ( b+t−min {t ,t } ,t +b−min { t , t } )

( b , b ) =( b , b )

Also the element (c , d) ¿( c , m)are R related.

( c , d ) R ( c , m ) ⟹ ( c , d ) ( d , c ) =( c ,m ) ( m, c )

( c +d −min { d , d } , d +c−min { d , d } )= ( c+ m−min { m ,m } , m+ c−min { m ,m } )

( c , c ) =( c , c )

By the definition aD b ⇔either a=b or there exist cϵSsuch that a L c and c R b. Then D = L o R.

Therefore (a , b ¿D(c , d) if there exist (c , b)∈B such that (a , b)L(c , b) and (c , b)R(c , d)

(a , b)L( c , b ) ⟺ ( b , a )( a ,b )=( b , c ) ( c ,b )

( b+ a−a , a+b−a )= ( b+c−c , c +b−c )

( b , b ) =( b , b )

(c , b)R( c , d ) ⇔ ( c , b )( b , c )= ( c , d ) ( d ,c )

( c +b−b , b+ c−b ) =( c+ d−d , d +c−d )

( c , c ) =( c , c )

Hence the proved.

Subsemigroup of Bicyclic semigroup

A semigroup S is called cyclic subsemigroup provided that it has a generating system consisting

of one element. If this element is a one can write S= ⟨ a ⟩ . LetS= ⟨ a ⟩ be a finite cyclic semigroup,

28
then the sequence of elements. a l=a , a2 , a3 , .. .must contain repeating elements. Assume that the

elements a , a2 , a3 , .. ., a l are pairwise different and a l+1=a k , where k ≤ l. The number l is called

the order of a and is denoted by |a|, the number k is called the index of a and the number

m=( l+1 )−k is called the period of a. The pair (k , m) is called the type ofa.

From a k+m =ak we get that the different elements in the sequence a=a , a2 , a3 , .. . are

⟨ a ⟩ ={ a , a 2 , a3 , .. . ak +m−1 }

A subsemigroup of ¿ is a non-empty subset T of S which is closed under the multiplication

T . T ⊆T . In other words, T is a semigroup under the multiplication of S restricted toT . For

instance; ¿ is a subsemigroup of ¿. Let S be an inverse semigroup (monoid), and let A ⊆S be

non-empty. We say that A is an inverse subsemigroup (submonoid) of S if A is a subsemigroup

(submonoid) of S and for every a ∈ A we have that a l ∈ A as well.

Example 7: let (0,4),(0,5) ∈ B

( 0,4 )( 0,5 )=( 0+ 0−min { 4,0 } ,5+ 4−min { 4,0 })

¿ ( 0+0−0 , 5+4−0 )

¿ ( 0,9 )

Example 8: let (0,2),(0,6)

( 0,2 ) ( 0,6 )= ( 0+0−min { 2,0 } ,6 +2−min {2,0 })

¿ ( 0+0−0 , 6+2−0 )

¿ ( 0,8 )

29
Example 9: ( 0,3 ) , ( 0 , 2 ) ∈ B

( 0,3 ) ( 0,2 )=( 0+0−min { 3,0 } ,2+3−min { 3,0 } )

¿ ( 0+0−0 , 2+3−0 )

¿ ( 0,5 )

Result 3 Let A={( 0 , a ) :a ∈ N 0 } be a subset of B. Then for every ( 0 , a ) , ( 0 , b ) ∈ A, we have that

( 0 , a ) ( 0 , b )= ( 0 , a+b ) ∈ A and also ( 0,0 ) ∈ A.

So A is a subsemigroup/submonoid of B

Characterization of Green’s relations to subsemigroup of bicyclic semigroup

Example10 :(0,3) L(0,5)⇒ (3,0)(0,3)=(5,0)(0,5)

(3+0−0 , 0+3−0)=(5+0−0 , 0+5−0)

(3,3)≠ (5,5)

(0,9) R (0,6)⇒ (0,9)(9,0)=(0,6)(6,0)

(0+ 9−9,9+ 0−9)=(0+ 6−6,6+0−6)

( 0,0 ) =( 0,0 )

In a general form, let A={( 0 , a ) :a ∈ N 0 } be a subsemigroup of B in the figure above.

An elements (0 , a) is L related to (0 , b)

(0 , a) L(0 , b) ⟺ ( a , 0 ) ( 0 , a )= ( b ,0 )( 0 , b )

( a+ 0−0 , 0+ a−0 )=( b+ 0−0 , 0+ b−0 )

30
(a , a ) ≠ (b , b)

(0 , m) R (0 , n) ⟺ ( 0 , m )( m , 0 )=( 0 , n ) ( n , 0 )

( 0+ m−m, m+0−m )=( 0+n−n , n+0−n )

( 0,0 ) =( 0,0 )

Ideals of Bicyclic Semigroup

Let∅ ≠ I ⊆ S then I is a right ideal if IS ⊆ I (i.e. a ∈ I , s ∈ S ⇒ as ∈ I ). We say Iis a left ideal if

SI ⊆ I. Finally I is a (two sided) ideal if IS ∪ SI ⊆ I.

Example 11: ( 2,2 ) ( 3,4 )= ( 2+ 3−min {2,3 } , 2+4−min {2,3 })

¿ ( 2+3−2, 2+ 4−2 )

¿ ( 3,4 )

( 3,4 )( 2,2 )= ( 3+2−min { 4,2 } , 4+2−min { 4,2 } )

¿ ( 3+2−2, 4+2−2 )

¿ ( 3,4 )

Example 12: ( 4,4 ) ( 5,6 )=( 4+5−min { 4,5 } , 4 +6−min { 4,5 })

¿ ( 4 +5−4 , 4+6−4 )

¿ ( 5,6 )

( 5,6 ) ( 4,4 )=( 5+ 4−min { 6,4 } , 6+ 4−min { 6,4 })

¿ ( 5+ 4−4 , 6+ 4−4 )

31
¿ ( 5,6 )

Result 4. Let m∈ N 0 × N 0 be ideal. Then m= { ( x , y )| x , y ∈ N 0 × N 0} is a right ideal in the bicyclic

semigroup B. Indeed, let ( x , y )∈ m and let (a , b) ∈ B.

Proof : Then ( x , y )(a , b)=( x− y +t ,b−a+ t), where t=max ( y ,a). Now, we know that t ≥ y, so

t− y ≥ 0. Adding up these two inequalities, we get thatx− y +t ≥ 0, thus the product is indeed in

m.

Set of idempotents of Bicyclic Semigroup

e ∈ S is an idempotent if e 2=e . We put E( S)={e ∈ S∨e 2=e }.

Example 13: ( 2,2 ) ( 2,2 )=( 2+2−min { 2,2 } , 2+2−min {2,2 } )

¿ ( 2+2−2 , 2+2−2 )

¿ ( 2,2 )

Example 14: ( 9,9 ) ( 9,9 ) =( 9+9−min { 9,9 } , 9+9−min { 9,9 } )

¿ ( 9+ 9−9,9+ 9−9 )

¿ ( 9,9 )

Result 5. For the bicyclic semigroup B we have from Figure 2

E( B)= {(a , a)∨a∈ N 0 }

32
 References

Adair C. L. A, (1980), “Generalization of the bicyclic semigroup”, Semigroup Forum 21, 13-25.

Alan J. C. (2019), “Nine chapters on the semigroup Art”, Lecture notes for a tour through

semigroups. Porto Lisbon. Vol. 23, pp, 235

Brion M. (2012). On Algebraic Semigroups and Monoid. Institute Fourier, Universite’ de

Grenole, France. Vol. 1208, pp.55

Chinram R. and Siammai P. (2008).On Green’s relation for Γ −¿Semigroups and Reductive

Γ −¿ Semigroups.International Journal of Algebra, Vol. 2, 2008, no. 4, 187 - 195

Christopher H. (2015). Three approaches to inverse semigroups.European journal of pure and

applied mathematics Vol. 8, No. 3, 2015, 294-323

33
Clark C. E. (1980). Generalized Green’s theories, semigroup forum Vol. 20(2); pp. 95-127.

Clifford A. H., Preston G. B. (1964). The algebraic theory of semigroups,American

mathematical society, province, Rhode Island. no 7. Vol. 1 (second Edition)

Clifford A. H., Preston G. B. (1967). The algebraic theory of semigroups, Vol. 2 (Second

Edition), American mathematical society, province, Rhode Island.

Clifford A. H., Preston G. B. (1961). The algebraic theory of semigroups, volume 2, American

mathematical society, United State of American.

Colcombet T. (2011). Green’s relation and their use in automata theory. Proceedings of LATA

(2011), spring LNCS 6638(2011) 1-21.

Descalco L., Ruskuc N. (2005).Subsemigroup of the bicyclic monoid. Internet. J. Algebra and

computer, vol. 15, pp37-57.

Descalco L. and Higgins P. M. (2010). Generalized Green’s equivalences on the subsemigroup

of the bicyclicmonoid. Communications in Algebra, Vol.38-12 pp 4597-4612.

East J., Egri-Nagy, Mitchell J. D. and Peresse Y. (2019). Computing finite semigroups.Journal

of symbolic computation, Vol. 92, pp 110-155

Ehrenfeut A., Harju T. and Rozenberg G. (1992). Permutable Transformation semigroups.

Semigroup Forum, vol. 47(1), pp. 123-125.

Fountain J. B. (1982). Abundant semigroups. Proc. London Math. Soc. VOL. 44(3) PP. 103-129.

Gericke H. (1963).Theories der verbande, Bibliogrhisces institute, Mannheim, zbMATH.

34
Green J. A. (July 1951), on the structure of semigroups. Annals of mathematics (second series)

vol. 54(1): pp163-172.

Grillet M. P.(1970). Green’s relation in a semiring,Portugalie mathematic vol29, pp.181-195

Grillet P. A.(1995). Semigroup: An introduction to the structure of theory. CRC press, Taylor

and Francis Group, London. 5677

Harinath K. S. (1976). On a generalization of inverse semigroups. Non thesis based paper.Dept

of mathematics, Regional Engineering College, Tiruchirapalli. 620015

Harispakash G. (2016). A study of Green’s relation on Fuzzy semigroup. International Journal

of computational and applied mathematics. Research India publications, Vol. 11, pp. 1-8

Harju T. (1996). Lecture notes on semigroups. Department of mathematics, University of Turku

Fin-20014, Finland.

Howie J. M. (1976). An introduction to semigroup theory. Academic press, London. Pages 364

Howie J. M. (1995). Fundamentals of semigroup theory,London Mathematics Society, (the

claredon press, Oxford University press). Pages 364

Jamadar A. (2015). A study on inverse ordered semigroups. Journal to Dept. of Mathematics,

Visva-Bharati University, Santiniketan, West Bengal, India. VB - 1569 of 2015-16

Kar-ping S., Lan Du and Yugi G. (2010). Green’s relations and their Generalization on

semigroups. Discussionesmathematicae. 71-89.

Kenneth M. K., Hans S. and Benjamin W. A. (1969). Completely 0-Simple semigroups.

International journal of mathematics and mathematical science. Vol. 19(3) pp. 118

35
Kenneth S. C. (1949). Semigroup ideals. Master’s Thesis, University of Tennessee. Knoxville.

Pages 8.

Lawson M. V. (1998). Inverse semigroups: the theory of partial symmetries, World scientific.

Lothaire M. (2011). Algebraic combinatorics on words. Encyclopedia of mathematic and its

application. 90. Press p. 459.

Lukas F. and Manfred K. (2017). Green’s relations in finite transformation semigroups.

International computer science symposium in Russia. Theory and applications –pp 112-

125

Lypian E. S. (1953). Semigroups. American Mathematical Society. Vol. 2, pp. 2454

Margolis, W. S. and Benjamin (2006). Expansions of inverse semigroups.J. Aust. Math. Vol. 80,

pp 205-228.

Niovi K. (2006). Ideals and Green’s relations in ordered semigroups.International Journal of

Mathematics and Mathematical Sciences Volume 2006, Article ID 61286, Pages 1–8.

O’Hara A.. (2015). A study of Green’s relations on algebraic semigroups. Electronic Thesis and

Dissertation RepositorV . 3047.

Peter M. H. (1992). Techniques of semigroup theory. Oxford University press p. 28.

Valenza R. (2002). Linear Algebra: An introduction to Abstract Mathematics: Berlin springer

science and Business Media P. 22.

Vasantha K. W. B. (2002). Smarandache Semigroups. Department of mathematics. India

Institute ot Technology madras, Chennai-600036, India.pp. 95

36
Weisstein Eric W. (2002). CRC Concise Encyclopedia of Mathematics (2 ndEd.) CRC press, p.

1528.

Xavier M.(2010). On generalized inverse semigroups and Green’s relations. Linear algebra and

its applicatons. Vol. 434, issue8, pp 1836-1844.

37