Computing automorphism groups and isomorphism testing in finite groups
Howden, David J. A. (2012) Computing automorphism groups and isomorphism testing in finite groups. PhD thesis, University of Warwick.
WRAP_THESIS_Howden_2012.pdf - Submitted Version
Download (901Kb) | Preview
Official URL: http://webcat.warwick.ac.uk/record=b2582813~S1
We outline a new method for computing automorphism groups and performing isomorphism testing for soluble groups. We derive procedures for computing polycyclic presentations for soluble automorphism groups, allowing for much more efficient calculations. Finally, we demonstrate how these methods can be extended to tackle some non-soluble groups. Performance statistics are included for an implementation of these algorithms in the MAGMA [BCP97] language.
|Item Type:||Thesis or Dissertation (PhD)|
|Subjects:||Q Science > QA Mathematics|
|Library of Congress Subject Headings (LCSH):||Automorphisms, Isomorphisms (Mathematics), Solvable groups|
|Institution:||University of Warwick|
|Theses Department:||Mathematics Institute|
|Supervisor(s)/Advisor:||Holt, Derek F.|
|Sponsors:||Engineering and Physical Sciences Research Council (EPSRC)|
|Extent:||viii, 112 leaves|
Actions (login required)