St Andrews Research Repository

St Andrews University Home
View Item 
  •   St Andrews Research Repository
  • Mathematics & Statistics (School of)
  • Pure Mathematics
  • Pure Mathematics Theses
  • View Item
  •   St Andrews Research Repository
  • Mathematics & Statistics (School of)
  • Pure Mathematics
  • Pure Mathematics Theses
  • View Item
  •   St Andrews Research Repository
  • Mathematics & Statistics (School of)
  • Pure Mathematics
  • Pure Mathematics Theses
  • View Item
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.

Enumerating 0-simple semigroups

Thumbnail
View/Open
ChristopherRussellPhDThesis.pdf (2.710Mb)
Date
29/06/2021
Author
Russell, Christopher
Supervisor
Mitchell, James David
Ruškuc, Nik
Funder
Engineering and Physical Sciences Research Council (EPSRC)
Grant ID
EP/N509759/1
Keywords
Semigroups
Computational semigroup theory
Combinatorics
Matrices
Binary matrices
0-simple semigroups
Congruence free semigroups
E-unitary inverse semigroups
GAP
E-unitary inverse covers
Rees 0-matrix semigroups
Metadata
Show full item record
Altmetrics Handle Statistics
Altmetrics DOI Statistics
Abstract
Computational semigroup theory involves the study and implementation of algorithms to compute with semigroups. Efficiency is of central concern and often follows from the insight of semigroup theoretic results. In turn, computational methods allow for analysis of semigroups which can provide intuition leading to theoretical breakthroughs. More efficient algorithms allow for more cases to be computed and increases the potential for insight. In this way, research into computational semigroup theory and abstract semigroup theory forms a feedback loop with each benefiting the other. In this thesis the primary focus will be on counting isomorphism classes of finite 0-simple semigroups. These semigroups are in some sense the building blocks of finite semigroups due to their correspondence with the Greens 𝒟-classes of a semigroup. The theory of Rees 0-matrix semigroups links these semigroups to matrices with entries from 0-groups. Special consideration will be given to the enumeration of certain sub-cases, most prominently the case of congruence free semigroups. The author has implemented these enumeration techniques and applied them to count isomorphism classes of 0-simple semigroups and congruence free semigroups by order. Included in this thesis are tables of the number of 0-simple semigroups of orders less than or equal to 130, up to isomorphism. Also included are tables of the numbers of congruence free semigroups, up to isomorphism, with m Green’s ℒ-classes and n Green’s ℛ-classes for all mn less than or equal to 100, as well as for various other values of m,n. Furthermore a database of finite 0-simple semigroups has been created and we detail how this was done. The implementation of these enumeration methods and the database are publicly available as GAP code. In order to achieve these results pertaining to finite 0-simple semigroups we invoke the theory of group actions and prove novel combinatorial results. Most notably, we have deduced formulae for enumerating the number of binary matrices with distinct rows and columns up to row and column permutations. There are also two sections dedicated to covers of E-unitary inverse semigroups, and presentations of factorisable orthodox monoids, respectively. In the first, we explore the concept of a minimal E-unitary inverse cover, up to isomorphism, by defining various sensible orderings. We provide examples of Clifford semigroups showing that, in general, these orderings do not have a unique minimal element. Finally, we pose conjectures about the existence of unique minimal E-unitary inverse covers of Clifford semigroups, when considered up to an equivalence weaker than isomorphism. In the latter section, we generalise the theory of presentations of factorisable inverse monoids to the more general setting of factorisable orthodox monoids. These topics were explored early in the authors doctoral studies but ultimately in less depth than the research on 0-simple semigroups.
DOI
https://doi.org/10.17630/sta/109
Type
Thesis, PhD Doctor of Philosophy
Collections
  • Pure Mathematics Theses
URI
http://hdl.handle.net/10023/23558

Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

Related items

Showing items related by title, author, creator and subject.

  • Generation and presentations of semigroup constructions : Bruck-Reilly extensions and P-semigroups 

    Carvalho, Catarina A. S. (University of St Andrews, 2006) - Thesis
    In this thesis we study problems regarding finite presentability of Bruck-Reilly extensions, finite generation of the underlying monoids, and finite generation of P-unitary inverse semigroups. The first main question we ...
  • On generators, relations and D-simplicity of direct products, Byleen extensions, and other semigroup constructions 

    Baynes, Samuel (University of St Andrews, 2015-11-30) - Thesis
    In this thesis we study two different topics, both in the context of semigroup constructions. The first is the investigation of an embedding problem, specifically the problem of whether it is possible to embed any given ...
  • Graph automatic semigroups 

    Carey, Rachael Marie (University of St Andrews, 2016-06-24) - Thesis
    In this thesis we examine properties and constructions of graph automatic semigroups, a generalisation of both automatic semigroups and finitely generated FA-presentable semigroups. We consider the properties of graph ...
Advanced Search

Browse

All of RepositoryCommunities & CollectionsBy Issue DateNamesTitlesSubjectsClassificationTypeFunderThis CollectionBy Issue DateNamesTitlesSubjectsClassificationTypeFunder

My Account

Login

Open Access

To find out how you can benefit from open access to research, see our library web pages and Open Access blog. For open access help contact: openaccess@st-andrews.ac.uk.

Accessibility

Read our Accessibility statement.

How to submit research papers

The full text of research papers can be submitted to the repository via Pure, the University's research information system. For help see our guide: How to deposit in Pure.

Electronic thesis deposit

Help with deposit.

Repository help

For repository help contact: Digital-Repository@st-andrews.ac.uk.

Give Feedback

Cookie policy

This site may use cookies. Please see Terms and Conditions.

Usage statistics

COUNTER-compliant statistics on downloads from the repository are available from the IRUS-UK Service. Contact us for information.

© University of St Andrews Library

University of St Andrews is a charity registered in Scotland, No SC013532.

  • Facebook
  • Twitter