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

  • Copulae on products of compact Riemannian manifolds 

    Jupp, P.E. (2015-09) - Journal article
    Abstract One standard way of considering a probability distribution on the unit n -cube, [0 , 1]n , due to Sklar (1959), is to decompose it into its marginal distributions and a copula, i.e. a probability distribution on ...
  • Idempotent rank in the endomorphism monoid of a non-uniform partition 

    Dolinka, Igor; East, James; Mitchell, James D. (2016-02) - Journal article
    We calculate the rank and idempotent rank of the semigroup E(X,P) generated by the idempotents of the semigroup T(X,P), which consists of all transformations of the finite set X preserving a non-uniform partition P. We ...
  • Constructing flag-transitive, point-imprimitive designs 

    Cameron, Peter Jephson; Praeger, Cheryl E. (2015-04) - Journal article
    We give a construction of a family of designs with a specified point-partition and determine the subgroup of automorphisms leaving invariant the point-partition. We give necessary and sufficient conditions for a design in ...
  • Permutation groups and transformation semigroups : results and problems 

    Araujo, Joao; Cameron, Peter Jephson (Cambridge University Press, 2015-10) - Book item
    J.M. Howie, the influential St Andrews semigroupist, claimed that we value an area of pure mathematics to the extent that (a) it gives rise to arguments that are deep and elegant, and (b) it has interesting interconnections ...
  • Guessing games on triangle-free graphs 

    Cameron, Peter Jephson; Dang, Anh; Riis, Soren (2016) - Journal article
    The guessing game introduced by Riis is a variant of the "guessing your own hats" game and can be played on any simple directed graph G on n vertices. For each digraph G, it is proved that there exists a unique guessing ...

View more