Now showing items 6-10 of 414

    • Combinatorial algorithms in semigroups 

      Smith, Finlay Laughlan (University of St Andrews, 2022-06-14) - Thesis
      Computational 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 ...
    • Construction and comparison of semi-Latin rectangles 

      Uto, Nseobong Peter (University of St Andrews, 2021-06-29) - Thesis
      This work is concerned with semi-Latin rectangles (SLRs). These designs are row-column designs with nice combinatorial properties; and were introduced in Bailey and Monod (2001). They generalize the Latin squares (LSs) and ...
    • Finiteness conditions on semigroups relating to their actions and one-sided congruences 

      Miller, Craig (University of St Andrews, 2020-12-01) - Thesis
      The purpose of this thesis is threefold: firstly, to develop a systematic theory of presentations of monoid acts; secondly, to study finiteness conditions on semigroups relating to finite generation of one-sided congruences; ...
    • On constructing topology from algebra 

      Elliott, Luke (University of St Andrews, 2022-06-14) - Thesis
      In this thesis we explore natural procedures through which topological structure can be constructed from specific semigroups. We will do this in two ways: 1) we equip the semigroup object itself with a topological structure, ...
    • Interpolating between Hausdorff and box dimension 

      Banaji, Amlan (2023-11-28) - Thesis
      Hausdorff and box dimension are two familiar notions of fractal dimension. Box dimension can be larger than Hausdorff dimension, because in the definition of box dimension, all sets in the cover have the same diameter, but ...