Now showing items 1-9 of 9

  • Constructing 2-generated subgroups of the group of homeomorphisms of Cantor space 

    Hyde, James Thomas (University of St Andrews, 2017) - Thesis
    We study finite generation, 2-generation and simplicity of subgroups of H[sub]c, the group of homeomorphisms of Cantor space. In Chapter 1 and Chapter 2 we run through foundational concepts and notation. In Chapter 3 we ...
  • Generating "large" subgroups and subsemigroups 

    Jonušas, Julius (University of St Andrews, 2016) - Thesis
    In this thesis we will be exclusively considering uncountable groups and semigroups. Roughly speaking the underlying problem is to find “large” subgroups (or subsemigroups) of the object in question, where we consider ...
  • 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 ...
  • The maximal subgroups of the classical groups in dimension 13, 14 and 15 

    Schröder, Anna Katharina (University of St Andrews, 2015-11-30) - Thesis
    One might easily argue that the Classification of Finite Simple Groups is one of the most important theorems of group theory. Given that any finite group can be deconstructed into its simple composition factors, it is ...
  • 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 ...
  • Random generation and chief length of finite groups 

    Menezes, Nina E. (University of St Andrews, 2013) - Thesis
    Part I of this thesis studies P[subscript(G)](d), the probability of generating a nonabelian simple group G with d randomly chosen elements, and extends this idea to consider the conditional probability P[subscript(G,S ...
  • Restricted permutations, antichains, atomic classes and stack sorting 

    Murphy, Maximilian M. (University of St Andrews, 2003) - Thesis
    Involvement is a partial order on all finite permutations, of infinite dimension and having subsets isomorphic to every countable partial order with finite descending chains. It has attracted the attention of some celebrated ...
  • 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 ...
  • 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 ...