Use this URL to cite or link to this record in EThOS: https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.773441
Title: Semigroup congruences : computational techniques and theoretical applications
Author: Torpey, Michael
ISNI:       0000 0004 7960 8261
Awarding Body: University of St Andrews
Current Institution: University of St Andrews
Date of Award: 2019
Availability of Full Text:
Access from EThOS:
Access from Institution:
Abstract:
Computational semigroup theory is an area of research that is subject to growing interest. The development of semigroup algorithms allows for new theoretical results to be discovered, which in turn informs the creation of yet more algorithms. Groups have benefitted from this cycle since before the invention of electronic computers, and the popularity of computational group theory has resulted in a rich and detailed literature. Computational semigroup theory is a less developed field, but recent work has resulted in a variety of algorithms, and some important pieces of software such as the Semigroups package for GAP. Congruences are an important part of semigroup theory. A semigroup's congruences determine its homomorphic images in a manner analogous to a group's normal subgroups. Prior to the work described here, there existed few practical algorithms for computing with semigroup congruences. However, a number of results about alternative representations for congruences, as well as existing algorithms that can be borrowed from group theory, make congruences a fertile area for improvement. In this thesis, we first consider computational techniques that can be applied to the study of congruences, and then present some results that have been produced or precipitated by applying these techniques to interesting examples. After some preliminary theory, we present a new parallel approach to computing with congruences specified by generating pairs. We then consider alternative ways of representing a congruence, using intermediate objects such as linked triples. We also present an algorithm for computing the entire congruence lattice of a finite semigroup. In the second part of the thesis, we classify the congruences of several monoids of bipartitions, as well as the principal factors of several monoids of partial transformations. Finally, we consider how many congruences a finite semigroup can have, and examine those on semigroups with up to seven elements.
Supervisor: Mitchell, James David Sponsor: Engineering and Physical Sciences Research Council (EPSRC)
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID: uk.bl.ethos.773441  DOI:
Keywords: Semigroups ; Computational algebra ; Computational mathematics ; Congruences ; Algorithms ; Diagram semigroups ; Bipartitions ; Bipartition semigroups ; Partition semigroups ; Motzkin monoid ; Finite semigroups ; Finitely presented semigroups ; Simple semigroups ; 0-simple semigroups ; Inverse semigroups ; QA182.T7 ; Semigroups--Data processing
Share: