Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9652851 | Journal of Symbolic Computation | 2005 | 16 Pages |
Abstract
We describe practical algorithms for computing a polycyclic presentation and for facilitating a membership test for a polycyclic subgroup of GL(d,Q). A variation of this method can be used to check whether a finitely generated subgroup of GL(d,Q) is solvable or solvable-by-finite. We report on our implementations of the algorithms for determining a polycyclic presentation and checking solvability.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Björn Assmann, Bettina Eick,