Skip navigation
Skip navigation

Computing automorphisms of finite soluble groups

Smith, Michael J


There is a large collection of effective algorithms for computing information about finite soluble groups. The success in computation with these groups is primarily due to a computationally convenient representation of them by means of (special forms of) power conjugate presentations. A notable omission from this collection of algorithms is an effective algorithm for computing the automorphism group of a finite soluble group. An algorithm designed for finite groups in general provides...[Show more]

CollectionsOpen Access Theses
Date published: 1994
Type: Thesis (PhD)


File Description SizeFormat Image
b19051244_Smith_Michael_J.pdf8.04 MBAdobe PDFThumbnail

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator