Infinite iteration of matrix semigroups. II: Structure theorem for arbitrary semigroups up to aperiodic morphism

DOI10.1016/0021-8693(86)90070-0zbMath0626.20050OpenAlexW2060936678MaRDI QIDQ580507

Jianyong Qiao, Sumit K. Garg

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0021-8693(86)90070-0

zbMATH Keywords

Rees matrix semigroupaperiodic subsemigroupscyclic monoideasily globally computed semigroupsinfinite iterations of matrix semigroupstorsion semigroups

Mathematics Subject Classification ID

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

Related Items

PROFINITE SEMIGROUPS, VARIETIES, EXPANSIONS AND THE STRUCTURE OF RELATIVELY FREE PROFINITE SEMIGROUPS, FURTHER RESULTS ON MONOIDS ACTING ON TREES, On the Cantor-Dedekind property of the Tilson order on categories and graphs, Nonstandard characterization of pseudovarieties, Two algebraic approaches to variants of the concatenation product, The synthesis theorem for finite regular semigroups, and its generalization, A short proof that \(\hat S^+_ A\) is finite if S is finite, On the irreducibility of pseudovarieties of semigroups., Locally countable pseudovarieties, Stability and J-depth of expansions, John Rhodes and the theory of finite semigroups., Algebraic and topological theory of languages, Krohn-Rhodes complexity pseudovarieties are not finitely based, Inverse semigroups and extensions of groups by semilattices, Categories as algebra: An essential ingredient in the theory of monoids, Representations of relatively free profinite semigroups, irreducibility, and order primitivity, Semidirect products of pseudovarieties from the universal algebraist's point of view, Prime decomposition theorem for arbitrary semigroups: General holonomy decomposition and synthesis theorem, Decomposition techniques for finite semigroups, using categories. I, Decomposition techniques for finite semigroups, using categories. II, COMPLEXITY PSEUDOVARIETIES ARE NOT LOCAL: TYPE II SUBSEMIGROUPS CAN FALL ARBITRARILY IN COMPLEXITY, Semigroup expansions using the derived category, kernel, and Malcev products, Iteration of expansions. Unambiguous semigroups, Arbitrary vs. regular semigroups

Cites Work

• Categories as algebra: An essential ingredient in the theory of monoids
• The kernel of monoid morphisms
• Embedding of regular semigroups in wreath products
• Infinite iteration of matrix semigroups. I: Structure theorem for torsion semigroups
• On finite \(\mathcal J\)-trivial monoids
• On the complexity of finite semigroups
• Prime decomposition theorem for arbitrary semigroups: General holonomy decomposition and synthesis theorem
• Examples of varieties of semigroups
• Classification of noncounting events
• Unending chess, symbolic dynamics and a problem in semi-groups
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item