COMBINATORIAL TECHNIQUES FOR DETERMINING RANK AND IDEMPOTENT RANK OF CERTAIN FINITE SEMIGROUPS

DOI10.1017/S0013091501000530zbMath1011.20060MaRDI QIDQ4787810

Steve Seif, Inessa Levi

Publication date: 21 May 2003

Published in: Proceedings of the Edinburgh Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0013091501000530

zbMATH Keywords

partitions; directed graphs; idempotent rank; semigroups of selfmaps; minimal generating sets of idempotents; finite idempotent generated semigroups

Mathematics Subject Classification ID

05A18: Partitions of sets

20M20: Semigroups of transformations, relations, partitions, etc.

20M05: Free semigroups, generators and relations, word problems

05C20: Directed graphs (digraphs), tournaments

Related Items

Orbits of primitive $k$-homogenous groups on $(n-k)$-partitions with applications to semigroups, Ranks of Semigroups Generated by Order-Preserving Transformations with a Fixed Partition Type, The rank of the semigroup of transformations stabilising a partition of a finite set, On Rank Properties of Endomorphisms of Finite Circular Orders, Diagram monoids and Graham-Houghton graphs: idempotents and generating sets of ideals, The minimal number of generators of a finite semigroup., Constructive techniques for labeling constant weight Gray codes with applications to minimal generating sets of semigroups, Counting techniques to label constant weight Gray codes with links to minimal generating sets of semigroups, The rank of the endomorphism monoid of a uniform partition.