SearcharxivSearch

arXiv · 1806.11031

Cross-connection structure of concordant semigroups

Abstract

Cross-connection theory provides the construction of a semigroup from its ideal structure using small categories. A concordant semigroup is an idempotent-connected abundant semigroup whose idempotents generate a regular subsemigroup. We characterize the categories arising from the generalised Green relations in the concordant semigroup as consistent categories and describe their interrelationship using cross-connections. Conversely, given a pair of cross-connected consistent categories, we build a concordant semigroup. We use this correspondence to prove a category equivalence between the category of concordant semigroups and the category of cross-connected consistent categories. In the process, we illustrate how our construction is a generalisation of Nambooripad's cross-connection analysis of regular semigroups. We also identify the inductive cancellative category associated with a pair of cross-connected consistent categories.

Explore related subjects

Keep this discovery

BibTeXRIS

P. A. Azeef Muhammed, P. G. Romeo, K. S. S. Nambooripad. 2018-06-28. Cross-connection structure of concordant semigroups. https://arxiv.org/abs/1806.11031

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