Generating Sets of Completely 0-Simple Semigroups

DOI10.1080/00927870500276676zbMath1102.20038MaRDI QIDQ5719293

Robert D. Gray, Nikola Ruškuc

Publication date: 18 January 2006

Published in: Communications in Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00927870500276676

zbMATH Keywords

ranks; finite semigroups; minimal generating sets; 0-simple semigroups

Mathematics Subject Classification ID

20M10: General structure theory for semigroups

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

20M17: Regular semigroups

Related Items

The Ranks of Ideals in Various Transformation Monoids, Motzkin monoids and partial Brauer monoids, Diagram monoids and Graham-Houghton graphs: idempotents and generating sets of ideals, John Macintosh Howie: work and legacy, The minimal number of generators of a finite semigroup., Homological finiteness properties of monoids, their ideals and maximal subgroups., A formula for multiple classifiers in data mining based on Brandt semigroups, Computing finite semigroups, Maximal subgroups of free idempotent generated semigroups over the full linear monoid

Cites Work

• Unnamed Item
• On the ranks of certain finite semigroups of transformations
• Idempotents in completely 0-simple semigroups
• On the rank of completely 0-simple semigroups
• On finite 0-simple semigroups and graph theory