Reaching the minimum ideal in a finite semigroup

2015/06/04 by Nasim Karimi, Karimi, Nasim · 1 citation
Mathematics · #FOS: Mathematics #Group Theory (math.GR) #math.GR

paper · pdf · doi:10.48550/arxiv.1506.01633

29 pages

arxiv created 2015/06/04 · arxiv updated 2015/06/05

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

Cited by

• Spectral and combinatorial methods for efficiently computing the rank of unambiguous finite automata

Related

• On the depth of simplicial affine semigroup rings
• Ideals of quasi-absorbing elements in semigroups
• On minimal ideals in pseudo-finite semigroups
• The Rank of the Endomorphism Monoid of a Partition
• Representing the Smallest Ideal and it's closure in the semigroup (βN,.) as equivalence classes under the extension of divisibility relations