Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1506.01633

Reaching the minimum ideal in a finite semigroup

Nasim Karimi
View original source ↗Read source document ↗Export metadata ↓

Abstract

We introduce the depth parameters of a finite semigroup, which measure how hard it is to produce an element in the minimum ideal when we consider generating sets satisfying some minimality conditions. We estimate such parameters for some families of finite semigroups, and we obtain an upper bound for wreath products and direct products of two finite (transformation) monoids. Keywords: semigroup, generating set, minimum ideal, A-depth of a semigroup

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Nasim Karimi. 2015-06-04. Reaching the minimum ideal in a finite semigroup. https://arxiv.org/abs/1506.01633

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗