Degree 2 transformation semigroups as continuous maps on graphs: Complexity and examples

DOI10.1142/S0218196723500157MaRDI QIDQ6043405zbMATH OpenOpenAlexFDO

Authors S. W. Margolis, John L. Rhodes

Publication date 5 May 2023

Published in International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218196723500157

zbMATH Keywords

complexity of semigroupsdegree of a transformation semigroup

Mathematics Subject Classification ID

General structure theory for semigroups (20M10) Semigroups of transformations, relations, partitions, etc. (20M20) Representation of semigroups; actions of semigroups on sets (20M30)

Recommendations

• Degree 2 transformation semigroups as continuous maps on graphs: foundations and structure
• Complexity of identity checking in transformation semigroups of rank 2.
• Green's relations in finite transformation semigroups
• The complexity of properties of transformation semigroups
• Enumerating transformation semigroups

Cites work

• A profinite approach to stable pairs.
• An effective lower bound for group complexity of finite semigroups and automata
• APERIODIC POINTLIKES AND BEYOND
• Completely O-simple semigroups and their associated graphs and groups
• COMPLEXITY PSEUDOVARIETIES ARE NOT LOCAL: TYPE II SUBSEMIGROUPS CAN FALL ARBITRARILY IN COMPLEXITY
• Degree 2 transformation semigroups as continuous maps on graphs: foundations and structure
• scientific article; zbMATH DE number 4010790 (Why is no real title available?)
• scientific article; zbMATH DE number 3561239 (Why is no real title available?)
• Improved lower bounds for the complexity of finite semigroups
• INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
• k-transformation semigroups and a conjecture of Tilson
• Kernel systems - a global study of homomorphisms on finite semigroups
• Krohn-Rhodes complexity pseudovarieties are not finitely based
• On finite 0-simple semigroups and graph theory
• On the Dowling and Rhodes lattices and wreath products
• Pointlike sets: the finest aperiodic cover of a finite semigroup
• Sheaves in geometry and logic: a first introduction to topos theory
• STABLE PAIRS
• Subsemigroups and complexity via the presentation lemma
• The \(\mathfrak q\)-theory of finite semigroups.

Cited in

(2)

• Degree 2 transformation semigroups as continuous maps on graphs: foundations and structure
• Complexity of finite semigroups: history and decidability

This page was built for publication: Degree 2 transformation semigroups as continuous maps on graphs: Complexity and examples

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