Free adequate semigroups

Simple item page
dc.creatorKambites, Mark
dc.date2009-02-02
dc.date2009-05-08
dc.date.accessioned2026-07-07T13:12:29Z
dc.date.available2026-07-07T13:12:29Z
dc.descriptionWe 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.
dc.description24 pages, 3 figures, references added, typos fixed, some proofs shortened, results unchanged
dc.identifierhttps://arxiv.org/abs/0902.0297
dc.identifierhttp://arxiv.org/abs/0902.0297
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/229594
dc.subjectRings and Algebras
dc.subject20M10; 08A10, 08A50
dc.titleFree adequate semigroups
dc.typetext

Files

Collections

arXiv