Algorithms for polycyclic-by-finite groups
Sinanan, Shavak (2011) Algorithms for polycyclic-by-finite groups. PhD thesis, University of Warwick.
WRAP_THESIS_Sinanan_2011.pdf - Submitted Version
Download (1723Kb) | Preview
Official URL: http://webcat.warwick.ac.uk:80/record=b2580894~S1
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.
|Item Type:||Thesis or Dissertation (PhD)|
|Subjects:||Q Science > QA Mathematics|
|Library of Congress Subject Headings (LCSH):||Polycyclic groups|
|Official Date:||July 2011|
|Institution:||University of Warwick|
|Theses Department:||Mathematics Institute|
|Supervisor(s)/Advisor:||Holt, Derek F.|
|Sponsors:||University of Warwick|
|Extent:||xvi, 239 leaves|
Actions (login required)