Use this URL to cite or link to this record in EThOS: http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.560188
Title: Algorithms for polycyclic-by-finite groups
Author: Sinanan, Shavak
Awarding Body: University of Warwick
Current Institution: University of Warwick
Date of Award: 2011
Availability of Full Text:
Access through EThOS:
Access through Institution:
Abstract:
A set of fundamental algorithms for computing with polycyclic-by-finite groups is presented here. Polycyclic-by-finite groups arise naturally in a number of contexts; for example, as automorphism groups of large finite soluble groups, as quotients of finitely presented groups, and as extensions of modules by groups. No existing mode of representation is suitable for these groups, since they will typically not have a convenient faithful permutation representation. A mixed mode is used to represent elements of such a group; utilising a polycyclic presentation or a power-conjugate presentation for the elements of the normal subgroup, and a permutation representation for the elements of the quotient.
Supervisor: Not available Sponsor: University of Warwick
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID: uk.bl.ethos.560188  DOI: Not available
Keywords: QA Mathematics
Share: