Free adequate semigroups.

DOI10.1017/S1446788711001753MaRDI QIDQ5389477zbMATH OpenOpenAlexFDO

Authors Mark Kambites

Publication date 20 April 2012

Published in Journal of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0902.0297

zbMATH Keywords

Ehresmann semigroupsfree adequate semigroupsfree ample semigroupsfree objectsfree restriction semigroupsidempotentsMunn treesword problem

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Varieties and pseudovarieties of semigroups (20M07) General structure theory for semigroups (20M10)

Abstract: We give an explicit description of the free objects in the quasivariety of adequate semigroups, as sets of labelled directed trees under a natural combinatorial multiplication. The morphisms of the free adequate semigroup onto the free ample semigroup and into the free inverse semigroup are realised by a combinatorial "folding" operation which transforms our trees into Munn trees. We use these results to show that free adequate semigroups and monoids are J-trivial and never finitely generated as semigroups, and that those which are finitely generated as (2,1,1)-algebras have decidable word problem.

Recommendations

• Retracts of trees and free left adequate semigroups.
• THE FREE AMPLE MONOID
• The word problem for free adequate semigroups.
• scientific article; zbMATH DE number 4073302
• Free right type A semigroups

Cites work

• A new construction for free inverse semigroups
• A new construction for free inverse semigroups.
• Abundant Semigroups
• Adequate Semigroups
• Free inverse semigroups
• Free Inverse Semigroups
• Free right type A semigroups
• Left adequate and left Ehresmann monoids.
• Left adequate and left Ehresmann monoids. II.
• On free inverse semigroups
• On the Core of a Graph^†
• Restriction categories. I: Categories of partial maps
• Retracts of trees and free left adequate semigroups.
• Semigroups and ordered categories. I: The reduced case
• The core of a graph
• THE FREE AMPLE MONOID
• Topology of finite graphs

Cited in

(28)

• A Munn type representation for a class of E-semiadequate semigroups
• Domain and range for angelic and demonic compositions
• Ehresmann monoids: adequacy and expansions
• Beyond orthodox semigroups.
• A combinatorial approach to the structure of locally inverse semigroups
• A tribute to John B. Fountain
• Weakly \(B\)-orthodox semigroups.
• On Ehresmann semigroups
• The word problem for free adequate semigroups.
• Retracts of trees and free left adequate semigroups.
• Left adequate and left Ehresmann monoids.
• scientific article; zbMATH DE number 5307792 (Why is no real title available?)
• Graph representations of a free Clifford monoid and a free semilattice with identity.
• scientific article; zbMATH DE number 4073302 (Why is no real title available?)
• Free right type A semigroups
• Left adequate and left Ehresmann monoids. II.
• Structure theorems for weakly \(B\)-abundant semigroups.
• scientific article; zbMATH DE number 1751730 (Why is no real title available?)
• Ehresmann monoids.
• Matrix semigroups over semirings
• A characterization of adequate semigroups by forbidden subsemigroups.
• Proper Ehresmann semigroups
• Product decompositions of semigroups induced by action pairs
• F-birestriction monoids in enriched signature
• Pretzel monoids
• Relating ample and biample topological categories with Boolean restriction and range semigroups
• Forbidden configurations for coherency
• The algebra of functions with antidomain and range

This page was built for publication: Free adequate semigroups.

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