SearcharxivSearch

arXiv · 1603.02796

Cross-connections of the singular transformation semigroup

Abstract

Cross-connection is a construction of regular semigroups using certain categories called normal categories which are abstractions of the partially ordered sets of principal left (right) ideals of a semigroup. We describe the cross-connections in the semigroup $Sing(X)$ of all non-invertible transformations on a set $X$. The categories involved are characterized as the powerset category $\mathscr{P}(X)$ and the category of partitions $\Pi(X)$. We describe these categories and show how a permutation on $X$ gives rise to a cross-connection. Further we prove that every cross-connection between them is induced by a permutation and construct the regular semigroups that arise from the cross-connections. We show that each of the cross-connection semigroups arising this way is isomorphic to $Sing(X)$. We also describe the right reductive subsemigroups of $Sing(X)$ with the category of principal left ideals isomorphic to $\mathscr{P}(X)$. This study sheds light into the more general theory of cross-connections and also provides an alternate way of studying the structure of $Sing(X)$.

Explore related subjects

Keep this discovery

BibTeXRIS

P. A. Azeef Muhammed, A. R. Rajan. 2016-03-09. Cross-connections of the singular transformation semigroup. https://doi.org/10.1142/s0219498818500470

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