John Rhodes and the theory of finite semigroups.
From MaRDI portal
Publication:2447219
DOI10.1007/s00233-013-9543-2zbMath1291.20056OpenAlexW2010710544MaRDI QIDQ2447219
Benjamin Steinberg, Stuart W. Margolis
Publication date: 25 April 2014
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00233-013-9543-2
General structure theory for semigroups (20M10) History of mathematics in the 20th century (01A60) Biographies, obituaries, personalia, bibliographies (01A70) History of group theory (20-03)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Expansions, free inverse semigroups, and Schützenberger product
- Infinite iteration of matrix semigroups. II: Structure theorem for arbitrary semigroups up to aperiodic morphism
- Categories as algebra: An essential ingredient in the theory of monoids
- The Rhodes expansion and free objects in varieties of completely regular semigroups
- Reduction theorem for the type-II conjecture for finite monoids
- The kernel of monoid morphisms
- Infinite iteration of matrix semigroups. I: Structure theorem for torsion semigroups
- Group theory via global semigroup theory
- E-unitary inverse monoids and the Cayley graph of a group presentation
- Topologies for the free monoid
- Type-II conjecture is true for finite \(\mathcal J\)-trivial monoids
- Proof of the fundamental lemma of complexity (strong version) for arbitrary finite semigroups
- Pointlike sets: the finest aperiodic cover of a finite semigroup
- Improved lower bounds for the complexity of finite semigroups
- Lower bounds for complexity of finite semigroups
- Global structure theories for finite semigroups. Introduction. I: Extension of the fundamental theorem of finite semigroups. II: Axioms for complexity for all finite semigroups. III: Complexity of two-\(J\) class semigroups. IV: Synthesis of the classical and modern theory of finite semigroups
- Semigroups whose idempotents form a subsemigroup
- FURTHER RESULTS ON MONOIDS ACTING ON TREES
- INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
- Closed subgroups of free profinite monoids are projective profinite groups
- A PROFINITE APPROACH TO STABLE PAIRS
- APERIODIC POINTLIKES AND BEYOND
- Representation theory of finite semigroups, semigroup radicals and formal language theory
- Undecidability of the identity problem for finite semigroups
- ASH'S TYPE II THEOREM, PROFINITE TOPOLOGY AND MALCEV PRODUCTS: PART I
- Partial actions of groups and actions of inverse semigroups
- On The Profinite Topology on a Free Group
- PARTIAL ACTIONS OF GROUPS
- POINTLIKE SETS, HYPERDECIDABILITY AND THE IDENTITY PROBLEM FOR FINITE SEMIGROUPS
- UNDECIDABILITY, AUTOMATA, AND PSEUDOVARITIES OF FINITE SEMIGROUPS
- Krohn-Rhodes complexity pseudovarieties are not finitely based
- PROFINITE SEMIGROUPS, VARIETIES, EXPANSIONS AND THE STRUCTURE OF RELATIVELY FREE PROFINITE SEMIGROUPS
- A new notion of vertex independence and rank for finite graphs
- A Property of Finite Simple Non-Abelian Groups
- An effective lower bound for group complexity of finite semigroups and automata
- COMPLEXITY PSEUDOVARIETIES ARE NOT LOCAL: TYPE II SUBSEMIGROUPS CAN FALL ARBITRARILY IN COMPLEXITY
- Superboolean rank and the size of the largest triangular submatrix of a random matrix
- Maximal subsemigroups of finite semigroups
- Characters and complexity of finite semigroups
- The fundamental lemma of complexity for arbitrary finite semigroups
- Realizing complex boolean functions with simple groups
- A homomorphism theorem for finite semigroups
