Naturally Ordered Transformation Semigroups Preserving an Equivalence Relation and a Cross-section

2011 ◽  
Vol 18 (03) ◽  
pp. 523-532 ◽  
Author(s):  
Lei Sun ◽  
Weina Deng ◽  
Huisheng Pei
Keyword(s):  
Cross Section ◽  
Equivalence Relation ◽  
Transformation Semigroup ◽  
Natural Order ◽  
Transformation Semigroups ◽  
Full Transformation ◽  
Minimal Elements ◽  
Full Transformation Semigroup

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.

scholarly journals NATURALLY ORDERED TRANSFORMATION SEMIGROUPS PRESERVING AN EQUIVALENCE

2008 ◽  
Vol 78 (1) ◽  
pp. 117-128 ◽  
Author(s):  
LEI SUN ◽  
HUISHENG PEI ◽  
ZHENGXING CHENG
Keyword(s):  
Transformation Semigroup ◽  
Natural Order ◽  
Transformation Semigroups ◽  
Full Transformation ◽  
Minimal Elements ◽  
Full Transformation Semigroup ◽  
Image Position

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.

A PARTIAL ORDER ON TRANSFORMATION SEMIGROUPS THAT PRESERVE DOUBLE DIRECTION EQUIVALENCE RELATION

2013 ◽  
Vol 12 (08) ◽  
pp. 1350041 ◽  
Author(s):  
LEI SUN ◽  
JUNLING SUN
Keyword(s):  
Lower Bound ◽  
Partial Order ◽  
Equivalence Relation ◽  
Transformation Semigroup ◽  
Natural Partial Order ◽  
Transformation Semigroups ◽  
Full Transformation ◽  
Minimal Elements ◽  
Full Transformation Semigroup

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.

THE NATURAL ORDER FOR THE E-ORDER-PRESERVING TRANSFORMATION SEMIGROUPS

2012 ◽  
Vol 05 (03) ◽  
pp. 1250035 ◽  
Author(s):  
Huisheng Pei ◽  
Weina Deng
Keyword(s):  
Transformation Semigroup ◽  
Natural Order ◽  
Transformation Semigroups ◽  
Full Transformation ◽  
Minimal Elements ◽  
Full Transformation Semigroup ◽  
Finite Set

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.

scholarly journals The structure of elements in finite full transformation semigroups

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

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.

Some subsemigroups of infinite full transformation semigroups

1981 ◽  
Vol 88 (1-2) ◽  
pp. 159-167 ◽  
Author(s):  
J. M. Howie
Keyword(s):  
Transformation Semigroup ◽  
Infinite Cardinal ◽  
Transformation Semigroups ◽  
Full Transformation ◽  
Full Transformation Semigroup ◽  
Cardinal Numbers ◽  
Infinite Set

SynopsisAs in an earlier paper by the author, three cardinal numbers, the shift, the defect and the collapse, are associated with each element of the full transformation semigroup ℑ(X), where X is an infinite set. It is shown that the elements of finite shift and non-zero defect form a subsemigroup F of ℑ(X). Moreover, if E(F) denotes the set of idempotents in F then 〈E(F)〉 = F, but (E(F))n ⊂F for every finite n. For each infinite cardinal m not exceeding ∣X∣ the set Qm of balanced elements of weight m, i.e. those with shift, defect and collapse all equal to m, forms a subsemigroup of ℑ(X). Moreover, (E(Qm))4=Qm,(E(Qm))3⊂Qm.

scholarly journals Computation of the transformation semigroups on three letters

1972 ◽  
Vol 14 (3) ◽  
pp. 335-335 ◽  
Author(s):  
Carroll Wilde ◽  
Sharon Raney
Keyword(s):  
Transformation Semigroup ◽  
Functional Composition ◽  
Transformation Semigroups ◽  
Full Transformation ◽  
Full Transformation Semigroup

Let H denote a set with three elements, and T3 the full transformation semigroup on X, i.e. T3 consists of the twenty-seven self maps of X under functional composition. A transformation semigroup (briefly a τ-semigroup) on three letters is an ordered pair (X, S), where S is any subsemigroup of T3.

scholarly journals Finite full transformation semigroups as collections of random functions

1988 ◽  
Vol 30 (2) ◽  
pp. 203-211 ◽  
Author(s):  
B. Brown ◽  
P. M. Higgins
Keyword(s):  
Semigroup Theory ◽  
Transformation Semigroup ◽  
Transformation Semigroups ◽  
Full Transformation ◽  
Random Functions ◽  
Full Transformation Semigroup ◽  
Finite Set ◽  
Algebraic Semigroup

The collection of all self-maps on a non-empty set X under composition is known in algebraic semigroup theory as the full transformation semigroup on X and is written x. Its importance lies in the fact that any semigroup S can be embedded in the full transformation semigroup (where S1 is the semigroup S with identity 1 adjoined, if S does not already possess one). The proof is similar to Cayley's Theorem that a group G can be embedded in SG, the group of all bijections of G to itself. In this paper X will be a finite set of order n, which we take to be and so we shall write Tn for X.

Abundant Semigroups of Transformations Preserving an Equivalence Relation

2011 ◽  
Vol 18 (01) ◽  
pp. 77-82 ◽  
Author(s):  
Huisheng Pei ◽  
Huijuan Zhou
Keyword(s):  
Equivalence Relation ◽  
Transformation Semigroup ◽  
Equivalence Relations ◽  
Full Transformation ◽  
Full Transformation Semigroup ◽  
Abundant Semigroups

Let X be a set with |X| ≥ 3, [Formula: see text] the full transformation semigroup on X, and E an equivalence relation on X. Let TE(X) be the set of transformations f in [Formula: see text] which preserve E, i.e., (x,y) ∈ E implies (f(x),f(y)) ∈ E. It is known that TE(X) is a subsemigroup of [Formula: see text]. In this paper, we describe the equivalence relations E so that the semigroup TE(X) is abundant.

ABUNDANCE OF THE SEMIGROUP OF ALL TRANSFORMATIONS OF A SET THAT REFLECT AN EQUIVALENCE RELATION

2013 ◽  
Vol 13 (02) ◽  
pp. 1350088 ◽  
Author(s):  
LEI SUN ◽  
LIMIN WANG
Keyword(s):  
Equivalence Relation ◽  
Transformation Semigroup ◽  
Full Transformation ◽  
Full Transformation Semigroup

Let [Formula: see text] be the full transformation semigroup on a nonempty set X and E be an equivalence relation on X. We write [Formula: see text] Then T∃(X) is a subsemigroup of [Formula: see text]. In this paper, we proved that the semigroup T∃(X) is not abundant if X/E is infinite.

Combinatorial results relating to products of idempotents in finite full transformation semigroups

1990 ◽  
Vol 115 (3-4) ◽  
pp. 289-299 ◽  
Author(s):  
John M. Howie ◽  
Ewing L. Lusk ◽  
Robert B. McFadden
Keyword(s):  
Logic Programming ◽  
Programming Language ◽  
Transformation Semigroup ◽  
Transformation Semigroups ◽  
Singular Element ◽  
Full Transformation ◽  
Logic Programming Language ◽  
Full Transformation Semigroup ◽  
Finite Set

SynopsisEach singular element α of the full transformation semigroup on a finite set is generated by the idempotents of defect one. The length of the shortest expression of α as a product of such idempotents is given by the gravity function g(α).We use certain consequences of a result by Tatsuhiko Saito to explore connections between the defect and the gravity of α, and then determine the number of elements that have maximum gravity. Finally, we obtain formulae for the number of elements of small gravity. Such elements must have defect 1, and we determine their number within each ℋ-class. Many of the results obtained were suggested, and all have been verified, by programs written in PROLOG, a logic programming language very well suited for algebraic calculations.

Sign in / Sign up

Export Citation Format

Share Document