Generating sets of infinite full transformation semigroups with restricted range

2016 ◽  
Vol 82 (12) ◽  
pp. 55-63
Author(s):  
K. Tinpun ◽  
J. Koppitz
Keyword(s):  
Restricted Range ◽  
Transformation Semigroups ◽  
Full Transformation ◽  
Generating Sets

scholarly journals On relative ranks of finite transformation semigroups with restricted range

2021 ◽  
Vol 73 (5) ◽  
pp. 617-626
Author(s):  
I. Dimitrova ◽  
J. Koppitz
Keyword(s):  
Restricted Range ◽  
Finite Chain ◽  
Transformation Semigroups ◽  
Relative Rank ◽  
Generating Sets ◽  
Finite Transformation

UDC 512.5 We determine the relative rank of the semigroup of all transformations on a finite chain with restricted range modulo the set of all orientation-preserving transformations in Moreover, we state the relative rank of the semigroup modulo the set of all order-preserving transformations in In both cases we characterize the minimal relative generating sets.  

scholarly journals Structure of principal one-sided ideals

2021 ◽  
pp. 1-53
Author(s):  
James East
Keyword(s):  
Structural Analysis ◽  
Restricted Range ◽  
Transformation Semigroups ◽  
Inverse Monoids ◽  
Full Transformation

We give a thorough structural analysis of the principal one-sided ideals of arbitrary semigroups, and then apply this to full transformation semigroups and symmetric inverse monoids. One-sided ideals of these semigroups naturally occur as semigroups of transformations with restricted range or kernel.

scholarly journals Variants of finite full transformation semigroups

2015 ◽  
Vol 25 (08) ◽  
pp. 1187-1222 ◽  
Author(s):  
Igor Dolinka ◽  
James East
Keyword(s):  
Transformation Semigroup ◽  
Transformation Semigroups ◽  
Full Transformation ◽  
Regular Elements ◽  
Full Transformation Semigroup ◽  
Generating Sets ◽  
Idempotent Rank ◽  
Finite Set

The variant of a semigroup [Formula: see text] with respect to an element [Formula: see text], denoted [Formula: see text], is the semigroup with underlying set [Formula: see text] and operation ⋆ defined by [Formula: see text] for [Formula: see text]. In this paper, we study variants [Formula: see text] of the full transformation semigroup [Formula: see text] on a finite set [Formula: see text]. We explore the structure of [Formula: see text] as well as its subsemigroups [Formula: see text] (consisting of all regular elements) and [Formula: see text] (consisting of all products of idempotents), and the ideals of [Formula: see text]. Among other results, we calculate the rank and idempotent rank (if applicable) of each semigroup, and (where possible) the number of (idempotent) generating sets of the minimal possible size.

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 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.

scholarly journals Square roots in finite full transformation semigroups

1982 ◽  
Vol 23 (2) ◽  
pp. 137-149 ◽  
Author(s):  
Mary Snowden ◽  
J. M. Howie
Keyword(s):  
Transformation Semigroup ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Necessary Condition ◽  
Square Root ◽  
Transformation Semigroups ◽  
Full Transformation ◽  
Square Roots ◽  
Finite Set ◽  
Necessary And Sufficient

Let X be a finite set and let (X) be the full transformation semigroup on X, i.e. the set of all mappings from X into X, the semigroup operation being composition of mappings. This paper aims to characterize those elements of (X) which have square roots. An easily verifiable necessary condition, that of being quasi-square, is found in Theorem 2, and in Theorems 4 and 5 we find necessary and sufficient conditions for certain special elements of (X). The property of being compatibly amenable is shown in Theorem 7 to be equivalent for all elements of (X) to the possession of a square root.

Sign in / Sign up

Export Citation Format

Share Document