Now showing items 1-5 of 5

    • Application of the Todd-Coxeter coset enumeration algorithm 

      Campbell, C. M. (Colin Matthew) (University of St Andrews, 1975) - Thesis
      This thesis is concerned with a topic in combinatorial group theory and, in particular, with a study of some groups with finite presentations. After preliminary definitions and theorems we describe the Todd-Coxeter coset ...
    • Extremal problems in combinatorial semigroup theory 

      Mitchell, James David (University of St Andrews, 2002-07) - Thesis
      In this thesis we shall consider three types of extremal problems (i.e. problems involving maxima and minima) concerning semigroups. In the first chapter we show how to construct a minimal semigroup presentation that defines ...
    • Presentations and efficiency of semigroups 

      Ayik, Hayrullah (University of St Andrews, 1998) - Thesis
      In this thesis we consider in detail the following two problems for semigroups: (i) When are semigroups finitely generated and presented? (ii) Which families of semigroups can be efficiently presented? We also consider ...
    • Semigroup presentations 

      Ibrahim, Mohammed Ali Faya (University of St Andrews, 1997) - Thesis
      In this thesis we consider the following two fundamental problems for semigroup presentations: 1. Given a semigroup find a presentation defining it. 2. Given a presentation describe the semigroup defined by it. We ...
    • 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 ...