Use this URL to cite or link to this record in EThOS: http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.552680
Title: Topics in computational group theory : primitive permutation groups and matrix group normalisers
Author: Coutts, Hannah Jane
Awarding Body: University of St Andrews
Current Institution: University of St Andrews
Date of Award: 2011
Availability of Full Text:
Access through EThOS:
Access through Institution:
Abstract:
Part I of this thesis presents methods for finding the primitive permutation groups of degree d, where 2500 ≤ d < 4096, using the O'Nan-Scott Theorem and Aschbacher's theorem. Tables of the groups G are given for each O'Nan-Scott class. For the non-affine groups, additional information is given: the degree d of G, the shape of a stabiliser in G of the primitive action, the shape of the normaliser N in S[subscript(d)] of G and the rank of N. Part II presents a new algorithm NormaliserGL for computing the normaliser in GL[subscript(n)](q) of a group G ≤ GL[subscript(n)](q). The algorithm is implemented in the computational algebra system MAGMA and employs Aschbacher's theorem to break the problem into several cases. The attached CD contains the code for the algorithm as well as several test cases which demonstrate the improvement over MAGMA's existing algorithm.
Supervisor: Roney-Dougal, Colva Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID: uk.bl.ethos.552680  DOI: Not available
Keywords: QA174.7D36C7 ; Group theory--Data processing ; Permutation groups ; Matrix groups
Share: