Computing automorphism groups and isomorphism testing in finite groups
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 b...
Main Author: | |
---|---|
Published: |
University of Warwick
2012
|
Subjects: | |
Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.560383 |