SearcharxivSearch

arXiv · 1703.04139

Cross-connections and variants of the full transformation semigroup

Abstract

Cross-connection theory propounded by K. S. S. Nambooripad describes the ideal structure of a regular semigroup using the categories of principal left (right) ideals. A variant $\mathscr{T}_X^θ$ of the full transformation semigroup $(\mathscr{T}_X,\cdot)$ for an arbitrary $θ\in \mathscr{T}_X$ is the semigroup $\mathscr{T}_X^θ= (\mathscr{T}_X,\ast)$ with the binary operation $α\ast β= α\cdotθ\cdotβ$ where $α, β\in \mathscr{T}_X$. In this article, we describe the ideal structure of the regular part $Reg(\mathscr{T}_X^θ)$ of the variant of the full transformation semigroup using cross-connections. We characterize the constituent categories of $Reg(\mathscr{T}_X^θ)$ and describe how they are \emph{cross-connected} by a functor induced by the sandwich transformation $θ$. This lead us to a structure theorem for the semigroup and give the representation of $Reg(\mathscr{T}_X^θ)$ as a cross-connection semigroup. Using this, we give a description of the biordered set and the sandwich sets of the semigroup.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

P. A. Azeef Muhammed. 2017-06-29. Cross-connections and variants of the full transformation semigroup. https://doi.org/10.14232/actasm-017-044-z

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR