Main areas of research activity are algebra, including group theory, semigroup theory, lattice theory, and computational group theory, and analysis, including fractal geometry, multifractal analysis, complex dynamical systems, Kleinian groups, and diophantine approximations.

For more information please visit the School of Mathematics and Statistics home page.

Collections in this community

Recent Submissions

  • Flatness, extension and amalgamation in monoids, semigroups and rings 

    Renshaw, James Henry (University of St Andrews, 1986) - Thesis
    We begin our study of amalgamations by examining some ideas which are well-known for the category of R-modules. In particular we look at such notions as direct limits, pushouts, pullbacks, tensor products and flatness in ...
  • Dimension theory of random self-similar and self-affine constructions 

    Troscheit, Sascha (University of St Andrews, 2017-06-23) - Thesis
    This thesis is structured as follows. Chapter 1 introduces fractal sets before recalling basic mathematical concepts from dynamical systems, measure theory, dimension theory and probability theory. In Chapter 2 we give ...
  • 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 ...
  • Topological graph inverse semigroups 

    Mesyan, Z.; Mitchell, J. D.; Morayne, M.; Péresse, Y. H. (2016-08-01) - Journal article
    To every directed graph E one can associate a graph inverse semigroup G(E), where elements roughly correspond to possible paths in E . These semigroups generalize polycyclic monoids, and they arise in the study of Leavitt ...
  • ℤ4-codes and their Gray map images as orthogonal arrays 

    Cameron, Peter Jephson; Kusuma, Josephine; Solé, Patrick (2017-07) - Journal article
    A classic result of Delsarte connects the strength (as orthogonal array) of a linear code with the minimum weight of its dual: the former is one less than the latter.Since the paper of Hammons et al., there is a lot of ...

View more