scholarly journals The Idempotent-separating Congruences on a Regular 0-bisimple Semigroup

1967 ◽  
Vol 15 (3) ◽  
pp. 233-240 ◽  
Author(s):  
W. D. Munn

A congruence ρ on a semigroup is said to be idempotent-separating if each ρ-class contains at most one idempotent. For any idempotent e of a semigroup S the set eSe is a subsemigroup of S with identity e and group of units He, the maximal subgroup of S containing e. The purpose of the present note is to show that if S is a regular O-bisimple semigroup and e is a non-zero idempotent of 5 then there is a one-to-one correspondence between the idempotentseparating congruences on 5 and the subgroups N of He with the property that aN ⊆ Na for all right units a of eSe and Nb ⊆ bN for all left units b of eSe. Some special cases of this result are discussed and, in the final section, an application is made to the principal factors of the full transformation semigroup on a set X.

1998 ◽  
Vol 128 (6) ◽  
pp. 1355-1369 ◽  
Author(s):  
Peter M. Higgins ◽  
John M. Howie ◽  
Nikola Ruškuc

If E is the set of idempotents and G the group of units within a full transformation semigroup ℐx, then EG = GE = ℐx if X is finite. The question of identifying the subsemigroup EG = GE = 〈G∪E〉 in the case where X is infinite leads to an investigation of interrelations among various naturally occurring subsemigroups of ℐX. In the final section it is shown that precisely two additional elements µ, v are needed in order that G∪E∪{µ, v} should generate ℐx.


1994 ◽  
Vol 37 (3) ◽  
pp. 471-476 ◽  
Author(s):  
I. Levi ◽  
R. B. McFadden

Certain subsemigroups of the full transformation semigroup Tn on a finite set of cardinality n are investigated, namely those subsemigroups S of Tn, which are normalised by the symmetric group on n elements, the group of units of Tn. The Sn-normal closure of an element of Tn is determined, and the structure of the Sn-normal ideals consisting of the members of Tn whose image contains at most r elements is studied.


1998 ◽  
Vol 57 (1) ◽  
pp. 59-71 ◽  
Author(s):  
Rachel Thomas

In this paper we consider the characterisation of those elements of a transformation semigroup S which are a product of two proper idempotents. We give a characterisation where S is the endomorphism monoid of a strong independence algebra A, and apply this to the cases where A is an arbitrary set and where A is an arbitrary vector space. The results emphasise the analogy between the idempotent generated subsemigroups of the full transformation semigroup of a set and of the semigroup of linear transformations from a vector space to itself.


2011 ◽  
Vol 18 (03) ◽  
pp. 523-532 ◽  
Author(s):  
Lei Sun ◽  
Weina Deng ◽  
Huisheng Pei

The paper is concerned with the so-called natural order on the semigroup [Formula: see text], where [Formula: see text] is the full transformation semigroup on a set X, E is a non-trivial equivalence on X and R is a cross-section of the partition X/E induced by E. We determine when two elements of TE(X,R) are related under this order, find elements of TE(X,R) which are compatible with ≤ on TE(X,R), and observe the maximal and minimal elements and the covering elements.


2005 ◽  
Vol 71 (1) ◽  
pp. 69-74 ◽  
Author(s):  
Gonca Ayik ◽  
Hayrullah Ayik ◽  
Yusuf Ünlü ◽  
John M. Howie

The index and period of an element a of a finite semigroup are the smallest values of m ≥ 1 and r ≥ 1 such that am+r = am. An element with index m and period 1 is called an m-potent element. For an element α of a finite full transformation semigroup with index m and period r, a unique factorisation α = σβ such that Shift(σ) ∩ Shift(β) = ∅ is obtained, where σ is a permutation of order r and β is an m-potent. Some applications of this factorisation are given.


2016 ◽  
Vol 09 (01) ◽  
pp. 1650042
Author(s):  
Somnuek Worawiset

We classify the maximal Clifford inverse subsemigroups [Formula: see text] of the full transformation semigroup [Formula: see text] on an [Formula: see text]-element set with [Formula: see text] for all [Formula: see text]. This classification differs from the already known classifications of Clifford inverse semigroups, it provides an algorithm for its construction. For a given natural number [Formula: see text], we find also the largest size of an inverse subsemigroup [Formula: see text] of [Formula: see text] satisfying [Formula: see text] with least rank [Formula: see text] for any element in [Formula: see text].


2008 ◽  
Vol 78 (1) ◽  
pp. 117-128 ◽  
Author(s):  
LEI SUN ◽  
HUISHENG PEI ◽  
ZHENGXING CHENG

AbstractLet 𝒯X be the full transformation semigroup on a set X and E be a nontrivial equivalence on X. Write then TE(X) is a subsemigroup of 𝒯X. In this paper, we endow TE(X) with the so-called natural order and determine when two elements of TE(X) are related under this order, then find out elements of TE(X) which are compatible with ≤ on TE(X). Also, the maximal and minimal elements and the covering elements are described.


2013 ◽  
Vol 12 (08) ◽  
pp. 1350041 ◽  
Author(s):  
LEI SUN ◽  
JUNLING SUN

Let [Formula: see text] be the full transformation semigroup on a nonempty set X and E be an equivalence relation on X. Then [Formula: see text] is a subsemigroup of [Formula: see text]. In this paper, we endow it with the natural partial order. With respect to this partial order, we determine when two elements are related, find the elements which are compatible and describe the maximal (minimal) elements. Also, we investigate the greatest lower bound of two elements.


2012 ◽  
Vol 05 (03) ◽  
pp. 1250035 ◽  
Author(s):  
Huisheng Pei ◽  
Weina Deng

Let (X, ≤) be a totally ordered finite set, [Formula: see text] be the full transformation semigroup on X and E be an arbitrary equivalence on X. We consider a subsemigroup of [Formula: see text] defined by [Formula: see text] and call it the E-order-preserving transformation semigroup on X. In this paper, we endow EOPX with the so-called natural order ≤ and discuss when two elements in EOPX are related under this order, then determine those elements of EOPX which are compatible with ≤. Also, the maximal (minimal) elements are described.


Sign in / Sign up

Export Citation Format

Share Document