Improved lower bounds for the complexity of finite semigroups

DOI10.1016/0022-4049(72)90022-9zbMath0257.20059OpenAlexW1971297153MaRDI QIDQ2559565

Bret Tilson, John L. Rhodes

Publication date: 1972

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-4049(72)90022-9

zbMATH Keywords

combinatorial semigrouplower bounds of group complexitywreath product of transformation semigroups

Mathematics Subject Classification ID

Semigroups of transformations, relations, partitions, etc. (20M20) Mappings of semigroups (20M15)

Related Items (36)

ON THE HYPERDECIDABILITY OF PSEUDOVARIETIES OF GROUPS ⋮ PROFINITE METHODS IN SEMIGROUP THEORY ⋮ Pointlike sets and separation: a personal perspective ⋮ Finite abundant semigroups in which the idempotents form a subsemigroup. ⋮ Covers for regular semigroups and an application to complexity ⋮ On a conjecture of Rhodes ⋮ On the Dowling and Rhodes lattices and wreath products ⋮ Abelian kernels, profinite topologies and the extension problem ⋮ Lower bounds for the \(\pi\)-length of (finite) \(\pi\)-solvable semigroups ⋮ Degree 2 transformation semigroups as continuous maps on graphs: Complexity and examples ⋮ On an assertion of J. Rhodes and the finite basis and finite vertex rank problems for pseudovarieties. ⋮ John Rhodes and the theory of finite semigroups. ⋮ The minimal number of generators of a finite semigroup. ⋮ Decidability of complexity one-half for finite semigroups ⋮ The \(\mathbf G\)-exponent of a pseudovariety of semigroups ⋮ An effective lower bound for group complexity of finite semigroups and automata ⋮ A topological approach to a conjecture of Rhodes ⋮ BRET TILSON: HIS LIFE AND WORK ⋮ MODULES ⋮ A PROFINITE APPROACH TO STABLE PAIRS ⋮ New results on the conjecture of Rhodes and on the topological conjecture ⋮ Type-II conjecture is true for finite \(\mathcal J\)-trivial monoids ⋮ A NEW PROOF OF THE RHODES TYPE II CONJECTURE ⋮ ON SEMIGROUPS WHOSE IDEMPOTENT-GENERATED SUBSEMIGROUP IS APERIODIC ⋮ Membership of \(\mathbf A\vee\mathbf G\) for classes of finite weakly abundant semigroups. ⋮ Semigroups whose idempotents form a subsemigroup ⋮ Krohn-Rhodes complexity pseudovarieties are not finitely based ⋮ Kernel systems - a global study of homomorphisms on finite semigroups ⋮ Relative Abelian kernels of some classes of transformation monoids ⋮ Decomposition and complexity of finite semigroups ⋮ Representations of semigroups by linear transformations. I ⋮ COMPLEXITY PSEUDOVARIETIES ARE NOT LOCAL: TYPE II SUBSEMIGROUPS CAN FALL ARBITRARILY IN COMPLEXITY ⋮ ON ITERATED MAL'CEV PRODUCTS WITH A PSEUDOVARIETY OF GROUPS ⋮ Constructing divisions into power groups ⋮ Reduction theorem for the type-II conjecture for finite monoids ⋮ Completely regular semigroup varieties generated by Mal'cev products with groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof of the fundamental lemma of complexity (strong version) for arbitrary finite semigroups
• Complexity of finite semigroups
• Some results on finite semigroups
• Decomposition and complexity of finite semigroups
• Proof of the fundamental lemma of complexity (weak version) for arbitrary finite semigroups
• Lower bounds for complexity of finite semigroups
• Embedding Theorems for Semigroups
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• On finite 0-simple semigroups and graph theory
• The fundamental lemma of complexity for arbitrary finite semigroups

This page was built for publication: Improved lower bounds for the complexity of finite semigroups