Use this URL to cite or link to this record in EThOS: http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.538366
Title: Computational investigation into finite groups
Author: Taylor, Paul Anthony
Awarding Body: University of Manchester
Current Institution: University of Manchester
Date of Award: 2011
Availability of Full Text:
Access through EThOS:
Access through Institution:
Abstract:
We briefly discuss the algorithm given in [Bates, Bundy, Perkins, Rowley, J. Algebra, 316(2):849-868, 2007] for determining the distance between two vertices in a commuting involution graph of a symmetric group.We develop the algorithm in [Bates, Rowley, Arch. Math. (Basel), 85(6):485-489, 2005] for computing a subgroup of the normalizer of a 2-subgroup X in a finite group G, examining in particular the issue of when to terminate the randomized procedure. The resultant algorithm is capable of handling subgroups X of order up to 512 and is suitable, for example, for matrix groups of large degree (an example calculation is given using 112x112 matrices over GF(2)).We also determine the suborbits of conjugacy classes of involutions in several of the sporadic simple groups?namely Janko's group J4, the Fischer sporadic groups, and the Thompson and Harada-Norton groups. We use our results to determine the structure of some graphs related to this data.We include implementations of the algorithms discussed in the computer algebra package MAGMA, as well as representative elements for the involution suborbits.
Supervisor: Rowley, Peter ; Eaton, Charles Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID: uk.bl.ethos.538366  DOI: Not available
Keywords: Finite group theory ; Computational group theory
Share: