Generating Sets of Completely 0-Simple Semigroups
Authors:
- 1 November 2005
- journal article
- research article
- Published by Taylor & Francis in Communications in Algebra
- Vol. 33 (12) , 4657-4678
Abstract
A formula for the rank of an arbitrary finite completely 0-simple semigroup, represented as a Rees matrix semigroup ℳ0[G; I, Λ; P], is given. The result generalizes that of Ruškuc concerning the rank of connected finite completely 0-simple semigroups. The rank is expressed in terms of |I|, |Λ|, the number of connected components k of P, and a number r min, which we define. We go on to show that the number r min is expressible in terms of a family of subgroups of G, the members of which are in one-to-one correspondence with, and determined by the nonzero entries of, the components of P. A number of applications are given, including a generalization of a result of Gomes and Howie concerning the rank of an arbitrary Brandt semigroup B(G,{1,…,n}).Keywords
This publication has 7 references indexed in Scilit:
- Combinatorics2018
- Fundamentals of Semigroup Theory1995
- On the rank of completely 0-simple semigroupsMathematical Proceedings of the Cambridge Philosophical Society, 1994
- Idempotent rank in finite full transformation semigroupsProceedings of the Royal Society of Edinburgh: Section A Mathematics, 1990
- On the ranks of certain finite semigroups of transformationsMathematical Proceedings of the Cambridge Philosophical Society, 1987
- Idempotents in completely 0-simple semigroupsGlasgow Mathematical Journal, 1978
- On finite 0-simple semigroups and graph theoryTheory of Computing Systems, 1968