Show simple item record

Files in this item

FilesSizeFormatView

There are no files associated with this item.

Item metadata

dc.contributor.advisorMitchell, James David
dc.contributor.authorSmith, Finlay Laughlan
dc.coverage.spatial180en_US
dc.date.accessioned2024-02-15T14:04:03Z
dc.date.available2024-02-15T14:04:03Z
dc.date.issued2022-06-14
dc.identifier.urihttps://hdl.handle.net/10023/29260
dc.description.abstractComputational semigroup theory is concerned with developing and implementing algorithms for determining properties of semigroups. The problems in computational semigroup theory can often be divided into sub-problems in computational group theory and combinatorics. In this thesis, we demonstrate how to split a number of problems into group-theoretical and combinatorial sub-problems, and provide algorithms for solving the combinatorial sub-problems. The algorithms presented in this thesis have been implemented in C++ and GAP, and benchmarks are provided to show them practical. In Chapter 1, we introduce the necessary background in semigroup theory. In Chapter 2, we introduce a new algorithm for non-exhaustively determining the structure of a semigroup defined by generators, and show that it applies to certain families of matrices over semirings as well as a number of standard and well-known families to which previous algorithms apply. In Chapter 3 we describe and compute minimal generating sets for several naturally occurring monoids of boolean matrices, in particular the full boolean matrix monoid, Hall monoid, reflexive boolean matrix monoid, and upper and lower triangular boolean matrix monoids. These results extend the dimensions for which the ranks of these monoids are known. We also determine the rank of the 2 × 2 matrices over the max-plus and min-plus semirings with and without threshold, as well as the n × n matrices over Z/kZ relative to their group of units. Chapter 4 contains new algorithms for determining the translations and bitranslations of arbitrary finite semigroups. We also provide specialised algorithms for computing translations and bitranslations of semigroups defined by finite presentations, completely 0-simple semigroups, congruence-free semigroups, and completely-simple semigroups. Finally, Chapter 4 contains some further questions raised by the work in this thesis.en_US
dc.language.isoenen_US
dc.publisherUniversity of St Andrewsen
dc.subject.lccQA182.S6
dc.subject.lcshAlgorithmsen
dc.subject.lcshSemigroupsen
dc.subject.lcshCombinatorial group theoryen
dc.titleCombinatorial algorithms in semigroupsen_US
dc.typeThesisen_US
dc.contributor.sponsorEngineering and Physical Sciences Research Council (EPSRC)en_US
dc.type.qualificationlevelDoctoralen_US
dc.type.qualificationnamePhD Doctor of Philosophyen_US
dc.publisher.institutionThe University of St Andrewsen_US
dc.identifier.grantnumberEP/N509759/1en_US


This item appears in the following Collection(s)

Show simple item record