Generating Sets of Completely 0-Simple Semigroups
From MaRDI portal
Publication:5719293
DOI10.1080/00927870500276676zbMATH Open1102.20038OpenAlexW2137609875MaRDI QIDQ5719293FDOQ5719293
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
Recommendations
Free semigroups, generators and relations, word problems (20M05) General structure theory for semigroups (20M10) Regular semigroups (20M17)
Cites Work
Cited In (18)
- Finding the isomorphisms of 0-simple semigroups
- Computing finite semigroups
- Homological finiteness properties of monoids, their ideals and maximal subgroups.
- Bipartite graphs and completely 0-simple semigroups.
- Maximal subgroups of free idempotent generated semigroups over the full linear monoid.
- The \(p_n\) sequences of semigroup varieties generated by combinatorial 0-simple semigroups.
- On the rank of completely 0-simple semigroups
- A formula for multiple classifiers in data mining based on Brandt semigroups
- Title not available (Why is that?)
- Irreducible generating sets of complete semigroups of unions.
- 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
- HALL'S CONDITION AND IDEMPOTENT RANK OF IDEALS OF ENDOMORPHISM MONOIDS
- The minimal number of generators of a finite semigroup.
- John Macintosh Howie: work and legacy
- On \(0\)-semisimplicity of linear hulls of generators for semigroups generated by idempotents.
- Completely zero-simple semigroups generated by nilpotent elements
This page was built for publication: Generating Sets of Completely 0-Simple Semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5719293)