Computing polycyclic presentations for polycyclic rational matrix groups

• Autores: Björn Assmann, Bettina Eick
• Localización: Journal of symbolic computation, ISSN 0747-7171, Vol. 40, Nº 6, 2005, págs. 1269-1284
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • We describe practical algorithms for computing a polycyclic presentation and for facilitating a membership test for a polycyclic subgroup of . A variation of this method can be used to check whether a finitely generated subgroup of is solvable or solvable-by-finite. We report on our implementations of the algorithms for determining a polycyclic presentation and checking solvability.