Decomposition techniques for finite semigroups, using categories. II
From MaRDI portal
Publication:1825290
DOI10.1016/0022-4049(89)90139-4zbMath0684.20055OpenAlexW4235698472WikidataQ127610106 ScholiaQ127610106MaRDI QIDQ1825290
Publication date: 1989
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(89)90139-4
finite semigroupsderived categorysemidirect productdecomposition of morphismsmaximal proper surmorphisms
Related Items
PROFINITE SEMIGROUPS, VARIETIES, EXPANSIONS AND THE STRUCTURE OF RELATIVELY FREE PROFINITE SEMIGROUPS, Cohomological results in monoid and category theory via classifying spaces, Locally trivial categories and unambiguous concatenation, Wreath products of algebras: Generalizing the Krohn-Rhodes theorem to arbitrary algebras, Two algebraic approaches to variants of the concatenation product, Locality of DS and associated varieties, Profinite categories and semidirect products, The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy, Equidivisibility and profinite coproduct, ALGEBRAIC CHARACTERIZATION OF LOGICALLY DEFINED TREE LANGUAGES, A STRUCTURAL APPROACH TO THE LOCALITY OF PSEUDOVARIETIES OF THE FORM LH ⓜ V, Standard automata and semidirect products of transformation semigroups, THE GLOBALS OF SOME SUBPSEUDOVARIETIES OF $\mathsf{DA}$, THE GLOBALS OF SOME SUBPSEUDOVARIETIES OF $\mathsf{DA}$, Decomposition techniques for finite semigroups, using categories. I, Semigroup expansions using the derived category, kernel, and Malcev products, UNDECIDABILITY, AUTOMATA, AND PSEUDOVARITIES OF FINITE SEMIGROUPS
Cites Work
- Inverse semigroups and extensions of groups by semilattices
- 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
- Almost finite expansions of arbitrary semigroups
- The kernel of monoid morphisms
- Decomposition techniques for finite semigroups, using categories. I
- Graph congruences and wreath products
- An interesting combinatorial method in the theory of locally 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
- Varieties of finite categories
- A homomorphism theorem for finite semigroups
- Unnamed Item
- Unnamed Item
