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

  • 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 ...
  • Rare events for the Manneville-Pomeau map 

    Freitas, Ana Cristina Moreira; Freitas, Jorge; Todd, Mike; Vaienti, Sandro (2016-11) - Journal article
    We prove a dichotomy for Manneville-Pomeau maps ƒ : [0, 1] → [0, 1] : given any point ζ ε [0, 1] , either the Rare Events Point Processes (REPP), counting the number of exceedances, which correspond to entrances in balls ...
  • Uniform scaling limits for ergodic measures 

    Fraser, Jonathan MacDonald; Pollicott, Mark (2017) - Journal article
    We provide an elementary proof that ergodic measures on one-sided shift spaces are ‘uniformly scaling’ in the following sense: at almost every point the scenery distributions weakly converge to a common distribution on the ...
  • Highest rank of a polytope for An 

    Cameron, Peter Jephson; Fernandes, Maria Elisa; Leemans, Dimitri; Mixer, Mark (2017-04-28) - Journal article
    We prove that the highest rank of a string C-group constructed from an alternating group Altn is 0 if n = 3, 4, 6, 7, 8; 3 if n = 5; 4 if n = 9; 5 if n = 10; 6 if n = 11; and the floor of (n-1)/2 if n ≥ 12. This solves a ...

View more