Now showing items 26-30 of 76

    • Orderings on words and permutations 

      McDevitt, Matthew (University of St Andrews, 2019-12-03) - Thesis
      Substructure orderings are ubiquitous throughout combinatorics and all of mathematics. In this thesis we consider various orderings on words, as well as the consecutive involvement ordering on permutations. Throughout ...
    • Assouad type dimensions and dimension spectra 

      Yu, Han (University of St Andrews, 2019-12-03) - Thesis
      In the first part of this thesis we introduce a new dimension spectrum motivated by the Assouad dimension; a familiar notion of dimension which, for a given metric space, returns the minimal exponent α ≥ 0 such that for ...
    • 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 ...