In this thesis we prove the following: The semigroup which is a disjoint union of two or three copies of a group is a Clifford semigroup, Rees matrix semigroup or a combination between a Rees matrix semigroup and a group. Furthermore, the semigroup which is a disjoint union of finitely many copies of a finitely presented (residually finite) group is finitely presented (residually finite) semigroup. The constructions of the semigroup which is a disjoint union of two copies of the free monogenic semigroup are parallel to the constructions of the semigroup which is a disjoint union of two copies of a group, i.e. such a semigroup is Clifford (strong semilattice of groups) or Rees matrix semigroup. However, the semigroup which is a disjoint union of three copies of the free monogenic semigroup is not just a strong semillatice of semigroups, Rees matrix semigroup or combination between a Rees matrix semigroup and a semigroup, but there are two more semigroups which do not arise from the constructions of the semigroup which is a disjoint union of three copies of a group. We also classify semigroups which are disjoint unions of two or three copies of the free monogenic semigroup. There are three types of semigroups which are unions of two copies of the free monogenic semigroup and nine types of semigroups which are unions of three copies of the free monogenic semigroup. For each type of such semigroups we exhibit a presentation defining semigroups of this type. The semigroup which is a disjoint union of finitely many copies of the free monogenic semigroup is finitely presented, residually finite, hopfian, has soluble word problem and has soluble subsemigroup membership problem.
| Identifer | oai:union.ndltd.org:bl.uk/oai:ethos.bl.uk:574790 |
| Date | January 2013 |
| Creators | Abu-Ghazalh, Nabilah Hani |
| Contributors | Ruskuc, Nik |
| Publisher | University of St Andrews |
| Source Sets | Ethos UK |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation |
| Source | http://hdl.handle.net/10023/3687 |
Page generated in 0.0019 seconds