Reduction theorem for the type-II conjecture for finite monoids
From MaRDI portal
Publication:805745
DOI10.1016/0022-4049(90)90048-MzbMATH Open0729.20026OpenAlexW2018994876WikidataQ122965850 ScholiaQ122965850MaRDI QIDQ805745FDOQ805745
Karsten Henckell, John L. Rhodes
Publication date: 1990
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(90)90048-m
Recommendations
- Type-II conjecture is true for finite \(\mathcal J\)-trivial monoids
- Abelian pointlikes of a monoid
- A NEW PROOF OF THE RHODES TYPE II CONJECTURE
- ASH'S TYPE II THEOREM, PROFINITE TOPOLOGY AND MALCEV PRODUCTS: PART I
- INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
Cites Work
- Title not available (Why is that?)
- On finite 0-simple semigroups and graph theory
- Improved lower bounds for the complexity of finite semigroups
- Unsolvability of the universal theory of finite groups
- A topological approach to a conjecture of Rhodes
- Almost finite expansions of arbitrary semigroups
- Semigroups whose idempotents form a subsemigroup
- Title not available (Why is that?)
- Decidability of complexity one-half for finite semigroups
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (13)
- John Rhodes and the theory of finite semigroups.
- An upper bound for the power pseudovariety \(\mathbf{PCS}\).
- About the power pseudovariety \(\mathbf{PCS}\)
- Title not available (Why is that?)
- A NEW PROOF OF THE RHODES TYPE II CONJECTURE
- Multifraction reduction. IV: Padding and Artin-Tits monoids of sufficiently large type
- Title not available (Why is that?)
- New results on the conjecture of Rhodes and on the topological conjecture
- Type-II conjecture is true for finite \(\mathcal J\)-trivial monoids
- Title not available (Why is that?)
- INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
- Types of reductive monoids
- A reduction theorem for the Galois–McKay conjecture
This page was built for publication: Reduction theorem for the type-II conjecture for finite monoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q805745)