Now showing items 21-25 of 69

    • Semigroup congruences : computational techniques and theoretical applications 

      Torpey, Michael (University of St Andrews, 2019-06-25) - Thesis
      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 ...
    • Computational techniques in finite semigroup theory 

      Wilson, Wilf A. (University of St Andrews, 2019-06-25) - Thesis
      A semigroup is simply a set with an associative binary operation; computational semigroup theory is the branch of mathematics concerned with developing techniques for computing with semigroups, as well as investigating ...
    • Some group presentations with few defining relations 

      Gill, David Michael (University of St Andrews, 1990) - Thesis
      We consider two classes of groups with two generators and three relations. One class has a similar presentation to groups considered in the paper by C.M. Campbell and R.M. Thomas, ‘On (2,n)-Groups related to Fibonacci ...
    • Decision problems in groups of homeomorphisms of Cantor space 

      Olukoya, Feyisayo (University of St Andrews, 2018-12-06) - Thesis
      The Thompson groups $F, T$ and $V$ are important groups in geometric group theory: $T$ and $V$ being the first discovered examples of finitely presented infinite simple groups. There are many generalisations of these groups ...
    • On plausible counterexamples to Lehnert's conjecture 

      Bennett, Daniel (University of St Andrews, 2018) - Thesis
      A group whose co-word problem is a context free language is called co𝐶𝐹 . Lehnert's conjecture states that a group 𝐺 is co𝐶𝐹 if and only if 𝐺 embeds as a finitely generated subgroup of R. Thompson's group V . In this ...