Semigroup amalgams: algorithmic questions and structure
In this survey paper the author first briefly reviews some of the early results concerning the embeddability of semigroup amalgams. For a given amalgam \([S,T;U]\) of monoids, with \(U\) a unitary submonoid of \(S\) and of \(T\), if the word problem for the amalgamated free product \(S*_UT\) is decidable, then the equality problem in the tensor product \(S\otimes_UT\) is necessarily also decidable; it is pointed out that even in the best circumstances, the latter need not be the case. The last section deals with some results on the structure of free amalgamated products, in particular with the structure of the maximal subgroups in the free amalgamated product for a given amalgam \([S,T;U]\) of regular semigroups, with \(U\) full in \(S\) and \(T\). For the entire collection see [Zbl 0946.00017].
- Algorithmic problems for amalgams of finite semigroups
- ON THE WORD PROBLEM FOR TENSOR PRODUCTS AND AMALGAMS OF MONOIDS
- Decidability versus undecidability of the word problem in amalgams of inverse semigroups.
- Amalgams of finite inverse semigroups.
- On the decidability of the word problem for amalgamated free products of inverse semigroups.
This page was built for publication: Semigroup amalgams: algorithmic questions and structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4527160)
