Kernel systems - a global study of homomorphisms on finite semigroups

DOI10.1016/0021-8693(77)90265-4MaRDI QIDQ1247497zbMATH OpenOpenAlexFDO

Authors K. Appert

Publication date 1977

Published in Journal of Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0021-8693(77)90265-4

Mathematics Subject Classification ID

Mappings of semigroups (20M15)

Cites work

• scientific article; zbMATH DE number 3179521 (Why is no real title available?)
• scientific article; zbMATH DE number 3561239 (Why is no real title available?)
• scientific article; zbMATH DE number 3210066 (Why is no real title available?)
• scientific article; zbMATH DE number 3353593 (Why is no real title available?)
• A homomorphism theorem for finite semigroups
• A reduction theorem for complexity of finite semigroups
• Decomposition and complexity of finite semigroups
• Improved lower bounds for the complexity of finite semigroups
• Lower bounds for complexity of finite semigroups
• On finite 0-simple semigroups and graph theory
• On the structure of semigroups
• Proof of the fundamental lemma of complexity (strong version) for arbitrary finite semigroups
• Proof of the fundamental lemma of complexity (weak version) for arbitrary finite semigroups
• Some results on finite semigroups
• The fundamental lemma of complexity for arbitrary finite semigroups

Cited in

(17)

• ON ITERATED MAL'CEV PRODUCTS WITH A PSEUDOVARIETY OF GROUPS
• On the equation \({\mathbf V}*{\mathbf G}={\mathcal E}{\mathbf V}\)
• ON HYPERDECIDABLE PSEUDOVARIETIES OF SIMPLE SEMIGROUPS
• A reduction theorem for complexity of finite semigroups
• On an assertion of J. Rhodes and the finite basis and finite vertex rank problems for pseudovarieties.
• Degree 2 transformation semigroups as continuous maps on graphs: Complexity and examples
• COMPLEXITY PSEUDOVARIETIES ARE NOT LOCAL: TYPE II SUBSEMIGROUPS CAN FALL ARBITRARILY IN COMPLEXITY
• Categories as algebra: An essential ingredient in the theory of monoids
• ON SEMIGROUPS WHOSE IDEMPOTENT-GENERATED SUBSEMIGROUP IS APERIODIC
• SOLVABLE MONOIDS WITH COMMUTING IDEMPOTENTS
• An upper bound for the complexity of transformation semigroups
• Krohn-Rhodes complexity pseudovarieties are not finitely based
• The Rhodes semilattice of a biased graph
• Subsemigroups and complexity via the presentation lemma
• On the Dowling and Rhodes lattices and wreath products
• Decidability of complexity one-half for finite semigroups
• An effective lower bound for group complexity of finite semigroups and automata

This page was built for publication: Kernel systems - a global study of homomorphisms on finite semigroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1247497)