2011
DOI: 10.1017/s1446788711001753
|View full text |Cite
|
Sign up to set email alerts
|

Free Adequate Semigroups

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, an… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

3
62
0

Year Published

2011
2011
2021
2021

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 23 publications
(65 citation statements)
references
References 23 publications
3
62
0
Order By: Relevance
“…We shall need a proposition, the essence of which is that the distinction between semigroups and monoids is unimportant. The proof is essentially the same as for the corresponding result in the (two-sided) adequate case, which can be found in [10].…”
Section: Corollary 25 Any Subset Of T 1 (σ) Closed Under the Operatmentioning
confidence: 61%
See 4 more Smart Citations
“…We shall need a proposition, the essence of which is that the distinction between semigroups and monoids is unimportant. The proof is essentially the same as for the corresponding result in the (two-sided) adequate case, which can be found in [10].…”
Section: Corollary 25 Any Subset Of T 1 (σ) Closed Under the Operatmentioning
confidence: 61%
“…The subset Σ (which generates F ) is called a free generating set for F , and its cardinality is the rank of F . The following theorem was the main result of [10].…”
Section: Theorem 22 the Pruning Mapmentioning
confidence: 96%
See 3 more Smart Citations