Structure of the (Total) Transformation Monoids Under Rank N Generators

<ns3:p>Throughout this paper our study focuses on transformation semigroups. These kinds of semigroups are the corner stone of semigroup theory. This is because every semigroup is isomorphic to transformation semigroup. The (total) transformation monoid T X n on a finite set X n = { 1 , 2 , … , n } where n ≥ 0 , n ∈ Z , is a semigroup of mapping that takes a set X n into itself, under the operation of composition of mapping with identity I X n . In this paper, we use an algebraic method for considering the monoid T ( Fl ) n ( G ) , where an independence algebra ( Fl ) n ( G ) is a disjointed union of sets of the form G x i for all 1 ≤ i ≤ n . Firstly, particular attention is paid to find the isomorphism between T ( Fl ) n ( G ) and the endomorphism monoid End ( F ℓ ) n ( G ) . Secondly, the embeddedness of T ( Fl ) n ( G ) in (full) wreath product of T n by G n has been found. Finally, the description of Green’s relation of T ( Fl ) n ( G ) has been provided.</ns3:p>

Authors

Institutions

Publication Details

Journal
F1000Research
Published
2026-02-02
DOI
https://doi.org/10.12688/f1000research.173831.1
Primary Topic
semigroups and automata theory
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Structure of the (Total) Transformation Monoids Under Rank N Generators

Asawer Al-Aadhami, Hala Sulaiman
F1000Research
semigroups and automata theory
article

Structure of the (Total) Transformation Monoids Under Rank N Generators

Asawer Al-Aadhami, Hala Sulaiman
article en

Abstract

<ns3:p>Throughout this paper our study focuses on transformation semigroups. These kinds of semigroups are the corner stone of semigroup theory. This is because every semigroup is isomorphic to transformation semigroup. The (total) transformation monoid T X n on a finite set X n = { 1 , 2 , … , n } where n ≥ 0 , n ∈ Z , is a semigroup of mapping that takes a set X n into itself, under the operation of composition of mapping with identity I X n . In this paper, we use an algebraic method for considering the monoid T ( Fl ) n ( G ) , where an independence algebra ( Fl ) n ( G ) is a disjointed union of sets of the form G x i for all 1 ≤ i ≤ n . Firstly, particular attention is paid to find the isomorphism between T ( Fl ) n ( G ) and the endomorphism monoid End ( F ℓ ) n ( G ) . Secondly, the embeddedness of T ( Fl ) n ( G ) in (full) wreath product of T n by G n has been found. Finally, the description of Green’s relation of T ( Fl ) n ( G ) has been provided.</ns3:p>

F1000ResearchVol. 15
University of Baghdad (IQ), Financial Research (Hungary) (HU)
Openalex Percentile: Top 68%
semigroups and automata theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Structure of the (Total) Transformation Monoids Under Rank N Generators — Asawer Al-Aadhami, Hala Sulaiman · F1000Research (2026) | TGRS Research Map | TGRS