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.

Recent Submissions

  • The infinite simple group V of Richard J. Thompson : presentations by permutations 

    Quick, Martyn; Bleak, Collin Patrick (2017) - Journal article
    We show that one can naturally describe elements of R. Thompson's finitely presented infinite simple group V, known by Thompson to have a presentation with four generators and fourteen relations, as products of permutations ...
  • Return times at periodic points in random dynamics 

    Haydn, Nicolai; Todd, Michael John (2017-01) - Journal article
    We prove a quenched limiting law for random measures on subshifts at periodic points. We consider a family of measures {µω}ω∈Ω, where the ‘driving space’ Ω is equipped with a probability measure which is invariant under a ...
  • Inhomogeneous self-similar sets with overlaps 

    Baker, Simon; Fraser, Jonathan M.; Máthé, András (2017-05-04) - Journal article
    It is known that if the underlying iterated function system satisfies the open set condition, then the upper box dimension of an inhomogeneous self-similar set is the maximum of the upper box dimensions of the homogeneous ...
  • Arithmetic patches, weak tangents, and dimension 

    Fraser, Jonathan MacDonald; Yu, Han (2017-11-01) - Journal article
    We investigate the relationships between several classical notions in arithmetic combinatorics and geometry including the presence (or lack of) arithmetic progressions (or patches in dimensions at least 2), the structure ...
  • Parallel algorithms for computing finite semigroups 

    Jonusas, Julius; Mitchell, J. D.; Pfeiffer, M. (2017-06-19) - Journal article
    In this paper, we present two algorithms based on the Froidure-Pin Algorithm for computing a finite semigroup. If U is any semigroup, and A be a subset of U, then we denote by ⟨A⟩ the least subsemigroup of U containing A.  ...

View more