Results 1 to 10 of about 71 (71)

A partial order on transformation semigroups with restricted range that preserve double direction equivalence

open access: yesOpen Mathematics, 2021
Let T(X)T\left(X) be the full transformation semigroup on a set XX. For an equivalence EE on XX, let TE∗(X)={α∈T(X):∀x,y∈X,(x,y)∈E⇔(xα,yα)∈E}.{T}_{{E}^{\ast }}\left(X)=\left\{\alpha \in T\left(X):\forall x,y\in X,\left(x,y)\in E\iff \left(x\alpha ,y ...
Sangkhanan Kritsada
doaj   +1 more source

Some results on semigroups of transformations with restricted range

open access: yesOpen Mathematics, 2021
Let XX be a non-empty set and YY a non-empty subset of XX. Denote the full transformation semigroup on XX by T(X)T\left(X) and write f(X)={f(x)∣x∈X}f\left(X)=\{f\left(x)| x\in X\} for each f∈T(X)f\in T\left(X). It is well known that T(X,Y)={f∈T(X)∣f(X)⊆Y}
Yan Qingfu, Wang Shoufeng
doaj   +1 more source

On pomonoid of partial transformations of a poset

open access: yesOpen Mathematics, 2023
The main objective of this article is to study the ordered partial transformations PO(X){\mathcal{PO}}\left(X) of a poset XX. The findings show that the set of all partial transformations of a poset with a pointwise order is not necessarily a pomonoid ...
Al Subaiei Bana
doaj   +1 more source

On semigroups of transformations that preserve a double direction equivalence

open access: yesOpen Mathematics, 2023
For a non-empty set XX, denote the full transformation semigroup on XX by T(X)T\left(X) and suppose that EE is an equivalence relation on XX. Evidently, TE∗(X)={α∈T(X)∣(x,y)∈Eif and only if(xα,yα)∈Efor allx,y∈X}{T}_{{E}^{\ast }}\left(X)=\left\{\alpha \in
Chen Hui, Liu Xin, Wang Shoufeng
doaj   +1 more source

On a locally compact monoid of cofinite partial isometries of ℕ with adjoined zero

open access: yesTopological Algebra and its Applications, 2022
Let 𝒞ℕ be a monoid which is generated by the partial shift α : n↦n +1 of the set of positive integers ℕ and its inverse partial shift β : n + 1 ↦n. In this paper we prove that if S is a submonoid of the monoid Iℕ∞ of all partial cofinite isometries of ...
Gutik Oleg, Khylynskyi Pavlo
doaj   +1 more source

Regularity and abundance on semigroups of partial transformations with invariant set

open access: yesOpen Mathematics, 2023
Let P(X)P\left(X) be a partial transformation semigroup on a non-empty set XX. For a fixed non-empty subset YY of XX, let PT¯(X,Y)={α∈P(X)∣(domα∩Y)α⊆Y}.\overline{PT}\left(X,Y)=\left\{\alpha \in P\left(X)| \left({\rm{dom}}\hspace{0.33em}\alpha \cap Y ...
Pantarak Thapakorn, Chaiya Yanisa
doaj   +1 more source

On idempotent generated semigroups [PDF]

open access: yes, 2002
We provide short and direct proofs for some classical theorems proved by Howie, Levi and McFadden concerning idempotent generated semigroups of transformations on a finite set.
Araújo, João
core   +1 more source

Ordered Regular Semigroups with Biggest Associates

open access: yesDiscussiones Mathematicae - General Algebra and Applications, 2019
We investigate the class BA of ordered regular semigroups in which each element has a biggest associate x† = max {y | xyx = x}. This class properly contains the class PO of principally ordered regular semigroups (in which there exists x⋆ = max {y | xyx ...
Blyth T.S., Santos M.H. Almeida
doaj   +1 more source

A NEW METHOD FOR CONSTRUCTING PARTIAL ONE TO ONE TRANSFORMATION SEMIGROUP USING TWO LINE NOTATION

open access: yesAcademy Journal of Science and Engineering, 2022
In this paper, we provide a method of constructing finite one to one transformation semigroup from the full one to one transformation semigroup using some pattern called transitive.
Muhammad Mansur Zubairu, Bashir Ali
doaj  

The join of split graphs whose completely regular endomorphisms form a monoid

open access: yesOpen Mathematics, 2017
In this paper, completely regular endomorphisms of the join of split graphs are investigated. We give conditions under which all completely regular endomorphisms of the join of two split graphs form a monoid.
Hou Hailong, Song Yanhua, Gu Rui
doaj   +1 more source

Home - About - Disclaimer - Privacy