FREE ADEQUATE SEMIGROUPS (902)
by
Mark Kambites
@MISC{Kambites902freeadequate,
author = {Mark Kambites},
title = {FREE ADEQUATE SEMIGROUPS},
year = {902}
}
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. 1.
Developed at and hosted by The College of Information Sciences and Technology
© 2007-2010 The Pennsylvania State University
