Wreath products of algebras: Generalizing the Krohn-Rhodes theorem to arbitrary algebras
DOI10.1007/BF02574084zbMATH Open0840.08001MaRDI QIDQ1905977FDOQ1905977
Authors: Joel VanderWerf
Publication date: 6 June 1996
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/135436
Recommendations
aperiodicitysolvabilityfinite algebrastame congruenceKrohn-Rhodes prime decomposition theoremwreath product decomposition
Structure theory of algebraic structures (08A05) Operations and polynomials in algebraic structures, primal algebras (08A40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The structure of finite algebras
- Categories as algebra: An essential ingredient in the theory of monoids
- A Property of Finite Simple Non-Abelian Groups
- The kernel of monoid morphisms
- Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
- Decomposition techniques for finite semigroups, using categories. II
- Embedding arbitrary algebras in groups
- Decomposition techniques for finite semigroups, using categories. I
Cited In (9)
- Zur Modelltheorie von Kranzprodukten. (On the model theory of wreath products)
- Merge decompositions, two-sided Krohn-Rhodes, and aperiodic pointlikes
- Affine wreath product algebras with trace maps of generic parity
- Even Faster Algorithms for CSAT Over supernilpotent Algebras.
- Title not available (Why is that?)
- Characterizing CTL-like logics on finite trees.
- Title not available (Why is that?)
- Matrix wreath products of algebras and embedding theorems
- Two results on wreath products: corrigendum and addendum
This page was built for publication: Wreath products of algebras: Generalizing the Krohn-Rhodes theorem to arbitrary algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1905977)