scholarly journals THE IDEAL STRUCTURE OF SEMIGROUPS OF TRANSFORMATIONS WITH RESTRICTED RANGE

2010 ◽  
Vol 83 (2) ◽  
pp. 289-300 ◽  
Author(s):  
SUZANA MENDES-GONÇALVES ◽  
R. P. SULLIVAN
Keyword(s):  
Nonempty Subset ◽  
Green’S Relations ◽  
Restricted Range ◽  
Ideal Structure ◽  
Regular Elements ◽  
Green's Relations ◽  
The Ideal

AbstractLet Y be a fixed nonempty subset of a set X and let T(X,Y ) denote the semigroup of all total transformations from X into Y. In 1975, Symons described the automorphisms of T(X,Y ). Three decades later, Nenthein, Youngkhong and Kemprasit determined its regular elements, and more recently Sanwong, Singha and Sullivan characterized all maximal and minimal congruences on T(X,Y ). In 2008, Sanwong and Sommanee determined the largest regular subsemigroup of T(X,Y ) when |Y |≠1 and Y ≠ X; and using this, they described the Green’s relations on T(X,Y ) . Here, we use their work to describe the ideal structure of T(X,Y ) . We also correct the proof of the corresponding result for a linear analogue of T(X,Y ) .

The semigroup of linear terms

2019 ◽  
Vol 12 (07) ◽  
pp. 2050005
Author(s):  
D. Phusanga ◽  
J. Koppitz
Keyword(s):  
Algebraic Structure ◽  
Linear Term ◽  
Green’S Relations ◽  
Ideal Structure ◽  
Regular Elements ◽  
Green's Relations ◽  
The Ideal

The set of linear terms, i.e. terms in which each variable occurs at most once, does not form a subsemigroup of the so-called diagonal semigroup. We consider the reduct of the diagonal semigroup to the linear terms, which is not a partial semigroup. We extend the set of linear terms by an expression “[Formula: see text]”, that is formally a linear term, obtaining a semigroup. The algebraic structure of this semigroup will be studied in this paper. We characterize the Green’s relations and the regular elements as well as the idempotent elements. Moreover, we discuss the ideal structure.

scholarly journals Green’s Relations on a Semigroup of Transformations with Restricted Range that Preserves an Equivalence Relation and a Cross-Section

Mathematics ◽  
2018 ◽  
Vol 6 (8) ◽  
pp. 134
Author(s):  
Chollawat Pookpienlert ◽  
Preeyanuch Honyam ◽  
Jintana Sanwong
Keyword(s):  
Cross Section ◽  
Equivalence Relation ◽  
Nonempty Subset ◽  
Identity Relation ◽  
Green’S Relations ◽  
Restricted Range ◽  
Green's Relations ◽  
Semigroup Of Transformations

Let T(X,Y) be the semigroup consisting of all total transformations from X into a fixed nonempty subset Y of X. For an equivalence relation ρ on X, let ρ^ be the restriction of ρ on Y, R a cross-section of Y/ρ^ and define T(X,Y,ρ,R) to be the set of all total transformations α from X into Y such that α preserves both ρ (if (a,b)∈ρ, then (aα,bα)∈ρ) and R (if r∈R, then rα∈R). T(X,Y,ρ,R) is then a subsemigroup of T(X,Y). In this paper, we give descriptions of Green’s relations on T(X,Y,ρ,R), and these results extend the results on T(X,Y) and T(X,ρ,R) when taking ρ to be the identity relation and Y=X, respectively.

scholarly journals The ideal structure of nilpotent-generated transformation semigroups

1999 ◽  
Vol 60 (2) ◽  
pp. 303-318 ◽  
Author(s):  
M. Paula O. Marques-Smith ◽  
R.P. Sullivan
Keyword(s):  
Green’S Relations ◽  
Ideal Structure ◽  
Transformation Semigroups ◽  
Green's Relations ◽  
Algebraic Properties ◽  
Rees Factor ◽  
Free Semigroups ◽  
One To One ◽  
Infinite Set ◽  
The Ideal

In 1987 Sullivan determined the elements of the semigroup N(X) generated by all nilpotent partial transformations of an infinite set X; and later in 1997 he studied subsemigroups of N(X) defined by restricting the index of the nilpotents and the cardinality of the set. Here, we describe the ideals and Green's relations on such semigroups, like Reynolds and Sullivan did in 1985 for the semigroup generated by all idempotent total transformations of X. We then use this information to describe the congruences on certain Rees factor semigroups and to construct families of congruence-free semigroups with interesting algebraic properties. We also study analogous questions for X finite and for one-to-one partial transformations.

scholarly journals Regularity and Green's Relations on a Semigroup of Transformations with Restricted Range

2008 ◽  
Vol 2008 ◽  
pp. 1-11 ◽  
Author(s):  
Jintana Sanwong ◽  
Worachead Sommanee
Keyword(s):  
Nonempty Subset ◽  
Transformation Semigroup ◽  
Green’S Relations ◽  
Sufficient Condition ◽  
Restricted Range ◽  
Necessary And Sufficient Condition ◽  
Full Transformation ◽  
Green's Relations ◽  
Necessary And Sufficient ◽  
Semigroup Of Transformations

LetT(X)be the full transformation semigroup on the setXand letT(X,Y)={α∈T(X):Xα⊆Y}. ThenT(X,Y)is a sub-semigroup ofT(X)determined by a nonempty subsetYofX. In this paper, we give a necessary and sufficient condition forT(X,Y)to be regular. In the case thatT(X,Y)is not regular, the largest regular sub-semigroup is obtained and this sub-semigroup is shown to determine the Green's relations onT(X,Y). Also, a class of maximal inverse sub-semigroups ofT(X,Y)is obtained.

scholarly journals Green's relations for regular elements of sandwich semigroups, II; semigroups of continuous functions

1978 ◽  
Vol 25 (1) ◽  
pp. 45-65 ◽  
Author(s):  
K. D. Magill ◽  
S. Subbiah
Keyword(s):  
Continuous Functions ◽  
Maximal Subgroups ◽  
Green’S Relations ◽  
Boolean Ring ◽  
Regular Elements ◽  
Ring Homomorphisms ◽  
Special Cases ◽  
Green's Relations ◽  
Sandwich Semigroup ◽  
Sandwich Semigroups

AbstractA sandwich semigroup of continuous functions consists of continuous functions with domains all in some space X and ranges all in some space Y with multiplication defined by fg = foαog where α is a fixed continuous function from a subspace of Y into X. These semigroups include, as special cases, a number of semigroups previously studied by various people. In this paper, we characterize the regular elements of such semigroups and we completely determine Green's relations for the regular elements. We also determine the maximal subgroups and, finally, we apply some of these results to semigroups of Boolean ring homomorphisms.

scholarly journals On the semigroup of all partial fence-preserving injections on a finite set

2017 ◽  
Vol 16 (12) ◽  
pp. 1750223 ◽  
Author(s):  
Ilinka Dimitrova ◽  
Jörg Koppitz
Keyword(s):  
Inverse Semigroup ◽  
Transformation Formula ◽  
Green’S Relations ◽  
Generating Set ◽  
Regular Elements ◽  
Green's Relations ◽  
Finite Set ◽  
Symmetric Inverse Semigroup ◽  
Text Element ◽  
Element Set

For [Formula: see text], let [Formula: see text] be an [Formula: see text]-element set and let [Formula: see text] be a fence, also called a zigzag poset. As usual, we denote by [Formula: see text] the symmetric inverse semigroup on [Formula: see text]. We say that a transformation [Formula: see text] is fence-preserving if [Formula: see text] implies that [Formula: see text], for all [Formula: see text] in the domain of [Formula: see text]. In this paper, we study the semigroup [Formula: see text] of all partial fence-preserving injections of [Formula: see text] and its subsemigroup [Formula: see text]. Clearly, [Formula: see text] is an inverse semigroup and contains all regular elements of [Formula: see text] We characterize the Green’s relations for the semigroup [Formula: see text]. Further, we prove that the semigroup [Formula: see text] is generated by its elements with rank [Formula: see text]. Moreover, for [Formula: see text], we find the least generating set and calculate the rank of [Formula: see text].

scholarly journals Green’s Relations on Regular Elements of Semigroup of Relational Hypersubstitutions for Algebraic Systems of Type ((m), (n))

2021 ◽  
Vol 53 ◽  
Author(s):  
Sorasak Leeratanavalee ◽  
Jukkrit Daengsaen
Keyword(s):  
Green’S Relations ◽  
Operation Symbol ◽  
Algebraic Systems ◽  
Regular Elements ◽  
Relational Term ◽  
Green's Relations ◽  
Algebraic Properties

Any relational hypersubstitution for algebraic systems of type (τ,τ′) = ((mi)i∈I,(nj)j∈J) is a mapping which maps any mi-ary operation symbol to an mi-ary term and maps any nj - ary relational symbol to an nj-ary relational term preserving arities, where I,J are indexed sets. Some algebraic properties of the monoid of all relational hypersubstitutions for algebraic systems of a special type, especially the characterization of its order and the set of all regular elements, were first studied by Phusanga and Koppitz[13] in 2018. In this paper, we study the Green’srelationsontheregularpartofthismonoidofaparticulartype(τ,τ′) = ((m),(n)), where m, n ≥ 2.

A generalized superposition of linear tree languages and products of linear tree languages

2018 ◽  
Vol 11 (04) ◽  
pp. 1850048
Author(s):  
Pongsakorn Kitpratyakul ◽  
Bundit Pibaljommee
Keyword(s):  
Green’S Relations ◽  
Linear Superposition ◽  
Tree Language ◽  
Regular Elements ◽  
Type Formula ◽  
Green's Relations ◽  
Tree Languages

A linear tree language of type [Formula: see text] is a set of linear terms, terms containing no multiple occurrences of the same variable, of that type. Instead of the usual generalized superposition of tree languages, we define the generalized linear superposition to deal with linear tree languages and study its properties. Using this superposition, we define the product of linear tree languages. This product is not associative on the collection of all linear tree languages, but it is associative on some subsets of this collection whose products of any element in the subsets are nonempty. We classify such subsets and study properties of the obtained semigroup especially idempotent elements, regular elements, and Green’s relations [Formula: see text] and [Formula: see text].

SEMIGROUPS OF TREE LANGUAGES

2008 ◽  
Vol 01 (04) ◽  
pp. 489-507 ◽  
Author(s):  
K. Denecke ◽  
N. Sarasit
Keyword(s):  
Left Zero ◽  
Green’S Relations ◽  
Regular Elements ◽  
Green's Relations ◽  
Tree Languages

Sets of terms of type τ are called tree languages (see [6]). There are several possibilities to define superposition operations on sets of tree languages. On the basis of such superposition operations we define binary associative operations on tree languages and investigate the properties of the arising semigroups. We characterize idempotent and regular elements and Green's relations [Formula: see text] and [Formula: see text]. Moreover, we determine constant, left-zero and right-zero subsemigroups and rectangular bands.

Sign in / Sign up

Export Citation Format

Share Document