REGULAR ELEMENTS AND GREEN'S RELATIONS IN GENERALIZED TRANSFORMATION SEMIGROUPS

2013 ◽  
Vol 06 (01) ◽  
pp. 1350006 ◽  
Author(s):  
Suzana Mendes-Gonçalves ◽  
R. P. Sullivan
Keyword(s):  
Equivalence Relations ◽  
Regularity Conditions ◽  
Green’S Relations ◽  
Transformation Semigroups ◽  
Regular Elements ◽  
Green's Relations ◽  
Semigroup Of Transformations

If X and Y are sets, we let P(X, Y) denote the set of all partial transformations from X into Y (that is, all mappings whose domain and range are subsets of X and Y, respectively). If θ ∈ P(Y, X), then P(X, Y) is a so-called "generalized semigroup" of transformations under the "sandwich operation": α * β = α ◦ θ ◦ β, for each α, β ∈ P(X, Y). We denote this semigroup by P(X, Y, θ) and, in this paper, we characterize Green's relations on it: that is, we study equivalence relations which determine when principal left (or right, or 2-sided) ideals in P(X, Y, θ) are equal. This solves a problem raised by Magill and Subbiah in 1975. We also discuss the same idea for important subsemigroups of P(X, Y, θ) and characterize when these semigroups satisfy certain regularity conditions.

REGULARITY AND GREEN'S RELATIONS OF GENERALIZED PARTIAL TRANSFORMATION SEMIGROUPS

2008 ◽  
Vol 01 (03) ◽  
pp. 295-302 ◽  
Author(s):  
Ronnason Chinram
Keyword(s):  
Transformation Semigroup ◽  
Partial Transformation ◽  
Green’S Relations ◽  
Transformation Semigroups ◽  
Regular Elements ◽  
Green's Relations

Let X be any set and P(X) be the partial transformation semigroup on X. It is well-known that P(X) is regular. To generalize this, let X and Y be any sets and P(X, Y) be the set of all partial transformations from X to Y. For θ ∈ P(Y, X), let (P(X, Y), θ) be a semigroup (P(X, Y), *) where α * β = αθβ for all α, β ∈ P(X, Y). In this paper, we characterize the semigroup (P(X, Y), θ) to be regular, regular elements of the semigroup (P(X, Y), θ), [Formula: see text]-classes, [Formula: see text]-classes, [Formula: see text]-classes and [Formula: see text]-classes of the semigroup (P(X, Y), θ).

scholarly journals Certain characterizations of varieties of bands

1988 ◽  
Vol 31 (2) ◽  
pp. 301-319 ◽  
Author(s):  
J. A. Gerhard ◽  
Mario Petrich
Keyword(s):  
Rectangular Band ◽  
Simple System ◽  
Left Zero ◽  
Green’S Relations ◽  
Transformation Semigroups ◽  
Lattice Of Varieties ◽  
Green's Relations ◽  
The World ◽  
New System

The lattice of varieties of bands was constructed in [1] by providing a simple system of invariants yielding a solution of the world problem for varieties of bands including a new system of inequivalent identities for these varieties. References [3] and [5] contain characterizations of varieties of bands determined by identities with up to three variables in terms of Green's relations and the functions figuring in a construction of a general band. In this construction, the band is expressed as a semilattice of rectangular bands and the multiplication is written in terms of functions among these rectangular band components and transformation semigroups on the corresponding left zero and right zero direct factors.

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

Sign in / Sign up

Export Citation Format

Share Document