SearcharxivSearch

arXiv · 1509.02886

Cross-connections of completely simple semigroups

Abstract

A completely simple semigroup S is a semigroup without zero which has no proper ideals and contains a primitive idempotent. It is known that S is a regular semigroup and any completely simple semigroup is isomorphic to the Rees matrix semigroup. In the study of structure theory of regular semigroups, K.S.S. Nambooripad introduced the concept of normal categories to construct the semigroup from its principal left(right) ideals using cross-connections. A normal category C is a small category with subobjects wherein each object of the category has an associated idempotent normal cone and each morphism admits a normal factorization. A cross-connection between two normal categories C and D is a local isomorphism frm D to N*C where N*C is the normal dual of the category C. In this paper, we identify the normal categories associated with a completely simple semigroup S and show that the semigroup of normal cones TL(S) is isomorphic to a semi-direct product of semigroups. We characterize the cross-connections in this case and show that each sandwich matrix P correspond to a cross-connection. Further we use each of these cross-connections to give a representation of the completely simple semigroup as a cross-connection semigroup.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Azeef Muhammed P A, A R Rajan. 2015-09-09. Cross-connections of completely simple semigroups. https://doi.org/10.1142/s1793557116500534

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