Now showing items 61-65 of 76

    • Semigroups of order-decreasing transformations 

      Umar, Abdullahi (University of St Andrews, 1992) - Thesis
      Let X be a totally ordered set and consider the semigroups of orderdecreasing (increasing) full (partial, partial one-to-one) transformations of X. In this Thesis the study of order-increasing full (partial, partial ...
    • Semigroup presentations 

      Ruškuc, Nik (University of St Andrews, 1995) - Thesis
      In this thesis we consider in detail 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 ...
    • Topics in computational group theory : primitive permutation groups and matrix group normalisers 

      Coutts, Hannah Jane (University of St Andrews, 2011-11) - Thesis
      Part I of this thesis presents methods for finding the primitive permutation groups of degree d, where 2500 ≤ d < 4096, using the O'Nan-Scott Theorem and Aschbacher's theorem. Tables of the groups G are given for each ...
    • Generation problems for finite groups 

      McDougall-Bagnall, Jonathan M. (University of St Andrews, 2011-11-30) - Thesis
      It can be deduced from the Burnside Basis Theorem that if G is a finite p-group with d(G)=r then given any generating set A for G there exists a subset of A of size r that generates G. We have denoted this property B. A ...
    • Directed graph iterated function systems 

      Boore, Graeme C. (University of St Andrews, 2011-11-30) - Thesis
      This thesis concerns an active research area within fractal geometry. In the first part, in Chapters 2 and 3, for directed graph iterated function systems (IFSs) defined on ℝ, we prove that a class of 2-vertex directed ...