Now showing items 71-75 of 90

    • 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 ...
    • Green index in semigroups : generators, presentations and automatic structures 

      Cain, A.J.; Gray, R; Ruskuc, Nik (2012) - Journal article
      The Green index of a subsemigroup T of a semigroup S is given by counting strong orbits in the complement S n T under the natural actions of T on S via right and left multiplication. This partitions the complement S nT ...
    • 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 ...
    • Growth rates for subclasses of Av(321) 

      Albert, M.H.; Atkinson, M.D.; Brignall, R; Ruskuc, Nik; Smith, R; West, J (2010-10-22) - Journal article
      Pattern classes which avoid 321 and other patterns are shown to have the same growth rates as similar (but strictly larger) classes obtained by adding articulation points to any or all of the other patterns. The method of ...