On finite 0-simple semigroups and graph theory

DOI10.1007/BF01703263zbMath0177.03103OpenAlexW1971886993WikidataQ105724748 ScholiaQ105724748MaRDI QIDQ5569146

Ronald L. Graham

Publication date: 1968

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01703263

zbMATH Keywords

generalized groups, semigroups

Related Items

Maximal subsemigroups of finite transformation and diagram monoids ⋮ Computing maximal subsemigroups of a finite semigroup ⋮ Subgroups of free idempotent generated semigroups need not be free. ⋮ Diagram monoids and Graham-Houghton graphs: idempotents and generating sets of ideals ⋮ On the subsemigroup complex of an aperiodic Brandt semigroup ⋮ Relationship between combinatorics and O-simple semigroups ⋮ Lower bounds for the \(\pi\)-length of (finite) \(\pi\)-solvable semigroups ⋮ Degree 2 transformation semigroups as continuous maps on graphs: Complexity and examples ⋮ A NEW METHOD IN THE FINITE BASIS PROBLEM WITH APPLICATIONS TO RANK 2 TRANSFORMATION SEMIGROUPS ⋮ Idempotent conjugacy in monoids ⋮ Bipartite graphs and completely 0-simple semigroups. ⋮ On an assertion of J. Rhodes and the finite basis and finite vertex rank problems for pseudovarieties. ⋮ VARIETIES GENERATED BY COMPLETELY 0-SIMPLE SEMIGROUPS ⋮ The minimal number of generators of a finite semigroup. ⋮ Permutations of a semigroup that map to inverses. ⋮ Regular principal factors in free objects in varieties in the interval \([\mathbf{B_2},\mathbf{NB_2}\vee\mathbf{G_n}\).] ⋮ A combinatorial approach to the structure of locally inverse semigroups ⋮ Generating Sets of Completely 0-Simple Semigroups ⋮ On classification of maximal nilpotent subsemigroups. ⋮ \(\mathsf E\)-local pseudovarieties. ⋮ Type-II conjecture is true for finite \(\mathcal J\)-trivial monoids ⋮ ON SEMIGROUPS WHOSE IDEMPOTENT-GENERATED SUBSEMIGROUP IS APERIODIC ⋮ Computing the ideal structure of finite semigroups ⋮ On nilpotent subsemigroups of the matrix semigroup over an antiring. ⋮ Relationships between combinatorics and 0-simple semigroups ⋮ Krohn-Rhodes complexity pseudovarieties are not finitely based ⋮ The free idempotent generated locally inverse semigroup ⋮ Universal locally finite maximally homogeneous semigroups and inverse semigroups ⋮ \(\aleph_0\)-categoricity of semigroups. II. ⋮ Kernel systems - a global study of homomorphisms on finite semigroups ⋮ Degree 2 transformation semigroups as continuous maps on graphs: Foundations and structure ⋮ Representation theory of finite semigroups, semigroup radicals and formal language theory ⋮ Shades of orthodoxy in Rees-Sushkevich varieties. ⋮ Matrix Mortality and the Černý-Pin Conjecture ⋮ Free idempotent generated semigroups: the word problem and structure via gain graphs ⋮ A generalization of the Rees theorem to a class of regular semigroups ⋮ Improved lower bounds for the complexity of finite semigroups ⋮ ON ITERATED MAL'CEV PRODUCTS WITH A PSEUDOVARIETY OF GROUPS ⋮ Translational hulls and block designs ⋮ Blocks of epigroups ⋮ Maximal subgroups of free idempotent generated semigroups over the full linear monoid ⋮ Reduction theorem for the type-II conjecture for finite monoids

Cites Work

• Maximal subsemigroups of finite semigroups
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On finite 0-simple semigroups and graph theory