Algorithms for polycyclic-by-finite groups
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 m...
| Main Author: | |
|---|---|
| Published: |
University of Warwick
2011
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.560188 |
| id |
ndltd-bl.uk-oai-ethos.bl.uk-560188 |
|---|---|
| record_format |
oai_dc |
| spelling |
ndltd-bl.uk-oai-ethos.bl.uk-5601882015-03-20T03:41:43ZAlgorithms for polycyclic-by-finite groupsSinanan, Shavak2011A 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.519QA MathematicsUniversity of Warwickhttp://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.560188http://wrap.warwick.ac.uk/49186/Electronic Thesis or Dissertation |
| collection |
NDLTD |
| sources |
NDLTD |
| topic |
519 QA Mathematics |
| spellingShingle |
519 QA Mathematics Sinanan, Shavak Algorithms for polycyclic-by-finite groups |
| description |
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. |
| author |
Sinanan, Shavak |
| author_facet |
Sinanan, Shavak |
| author_sort |
Sinanan, Shavak |
| title |
Algorithms for polycyclic-by-finite groups |
| title_short |
Algorithms for polycyclic-by-finite groups |
| title_full |
Algorithms for polycyclic-by-finite groups |
| title_fullStr |
Algorithms for polycyclic-by-finite groups |
| title_full_unstemmed |
Algorithms for polycyclic-by-finite groups |
| title_sort |
algorithms for polycyclic-by-finite groups |
| publisher |
University of Warwick |
| publishDate |
2011 |
| url |
http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.560188 |
| work_keys_str_mv |
AT sinananshavak algorithmsforpolycyclicbyfinitegroups |
| _version_ |
1716782618515603456 |