Now showing items 1-4 of 4

  • Algorithms for Nilpotent Linear Groups 

    Rossmann, Tobias (2011-03-04)
    In this thesis, we develop practical algorithms for irreducibility and primitivity testing of finite nilpotent linear groups defined over various fields of characteristic zero, including number fields and rational function ...
  • Automorphisms of Pairwise Combinatorial Designs 

    Ó Catháin, Padraig (2012-02-14)
    In this thesis, we investigate group actions on certain families of pairwise combinatorial designs, in particular Hadamard matrices and symmetric 2-(4t-1, 2t-1, t-1) designs. A Hadamard matrix H is called cocyclic if a ...
  • Classification Problems for Finite Linear Groups 

    Hurley, Barry (2013-03-08)
    This thesis is concerned with classification problems for finite linear groups. Our main concern is with groups of prime degree, and groups defined over finite fields and fields of zero characteristic. We use the computational ...
  • Topics in cocyclic development of pairwise combinatorial designs 

    Egan, Ronan (2015-10-14)
    This thesis is a compilation of results dealing with cocyclic development of pairwise combinatorial designs. Motivated by a classification of the indexing and extension groups of the Paley Hadamard matrices due to de ...