scholarly journals Congruences and Green's relations on eventually regular semigroups

1987 ◽  
Vol 43 (1) ◽  
pp. 64-69 ◽  
Author(s):  
P. M. Edwards ◽  
T. E. Hall
Keyword(s):  
Regular Semigroup ◽  
Green’S Relations ◽  
Regular Semigroups ◽  
Regular Elements ◽  
Green's Relations ◽  
Eventually Regular Semigroup

AbstractA semigroup is eventually regular if each of its elements has some power that is regular. Let 𝓚 be one of Green's relations and let ρ be a congruence on an eventually regular semigroup S. It is shown for 𝓚 = 𝓛, 𝓡 and 𝓓 that if A and B are regular elements of S/ρ that are 𝓚-related in S/ρ then there exist elements a ∈ A, b ∈ B such that a and b are 𝓚-related in S. The result is not true for 𝓗 or 𝓙.

scholarly journals CENTRALISERS IN THE INFINITE SYMMETRIC INVERSE SEMIGROUP

2012 ◽  
Vol 87 (3) ◽  
pp. 462-479 ◽  
Author(s):  
JANUSZ KONIECZNY
Keyword(s):  
Inverse Semigroup ◽  
Regular Semigroup ◽  
Green’S Relations ◽  
Completely Regular Semigroup ◽  
Completely Regular ◽  
Regular Elements ◽  
Green's Relations ◽  
Symmetric Inverse Semigroup ◽  
Alpha Beta

AbstractFor an arbitrary set $X$ (finite or infinite), denote by $\mathcal {I}(X)$ the symmetric inverse semigroup of partial injective transformations on $X$. For $ \alpha \in \mathcal {I}(X)$, let $C(\alpha )=\{ \beta \in \mathcal {I}(X): \alpha \beta = \beta \alpha \}$ be the centraliser of $ \alpha $ in $\mathcal {I}(X)$. For an arbitrary $ \alpha \in \mathcal {I}(X)$, we characterise the transformations $ \beta \in \mathcal {I}(X)$ that belong to $C( \alpha )$, describe the regular elements of $C(\alpha )$, and establish when $C( \alpha )$ is an inverse semigroup and when it is a completely regular semigroup. In the case where $\operatorname {dom}( \alpha )=X$, we determine the structure of $C(\alpha )$in terms of Green’s relations.

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 A NEW CONSTRUCTION FOR REGULAR SEMIGROUPS WITH QUASI-IDEAL ORTHODOX TRANSVERSALS

2009 ◽  
Vol 86 (2) ◽  
pp. 177-187 ◽  
Author(s):  
XIANGJUN KONG ◽  
XIANZHONG ZHAO
Keyword(s):  
Regular Semigroup ◽  
Structure Theorem ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Green’S Relations ◽  
Regular Semigroups ◽  
New Construction ◽  
Necessary And Sufficient ◽  
Equivalent Conditions ◽  
Orthodox Semigroups

AbstractIn any regular semigroup with an orthodox transversal, we define two sets R and L using Green’s relations and give necessary and sufficient conditions for them to be subsemigroups. By using R and L, some equivalent conditions for an orthodox transversal to be a quasi-ideal are obtained. Finally, we give a structure theorem for regular semigroups with quasi-ideal orthodox transversals by two orthodox semigroups R and L.

Normal bands of commutative cancellative semigroups revisited

2014 ◽  
Vol 24 (05) ◽  
pp. 531-551
Author(s):  
Mario Petrich
Keyword(s):  
Free Semigroup ◽  
Abelian Groups ◽  
Normal Band ◽  
Green’S Relations ◽  
Regular Semigroups ◽  
Completely Regular ◽  
Special Cases ◽  
Green's Relations ◽  
Completely Regular Semigroups

A semigroup S is of the type in the class of the title if S has a congruence ρ such that S/ρ is a normal band (i.e. satisfies the identities x2 = x and axya = ayxa) and all ρ-classes are commutative cancellative semigroups. We consider semigroups S with such a congruence first for completely regular semigroups, then characterize the general case in several ways, including some special cases. When S is an order in a normal band of abelian groups Q, we study the restrictions of Green's relations on Q to S. The paper concludes with the discussion of a free semigroup in the title on two generators.

scholarly journals Congruences and Green's relations on regular semigroups

1972 ◽  
Vol 13 (2) ◽  
pp. 167-175 ◽  
Author(s):  
T. E. Hall
Keyword(s):  
Generalized Inverse ◽  
Inverse Semigroups ◽  
Green’S Relations ◽  
Regular Semigroups ◽  
Green's Relations ◽  
Generalized Inverse Semigroups

It is sometimes possible to reconstruct semigroups from some of their homomorphic images. Some recent examples have been the construction of bisimple inverse semigroups from fundamental bisimple inverse semigroups [9], and the construction of generalized inverse semigroups from inverse semigroups [12].

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.

scholarly journals Group congruences on eventually regular semigroups

1988 ◽  
Vol 45 (3) ◽  
pp. 320-325 ◽  
Author(s):  
S. Hanumantha Rao ◽  
P. Lakshmi
Keyword(s):  
Regular Semigroup ◽  
Group Congruence ◽  
Regular Semigroups ◽  
Eventually Regular Semigroup ◽  
Lattice Of Congruences

AbstractA characterization of group congruences on an eventually regular semigroup S is provided. It is shown that a group congruence is dually right modular in the lattice of congruences on S. Also for any group congruence ℸ and any congruence p on S, ℸ Vp and kernel ℸ Vp are described.

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

Sign in / Sign up

Export Citation Format

Share Document