Algorithms for Matrix Groups and the Tit
β
Robert Beals
π
Article
π
1999
π
Elsevier Science
π
English
β 224 KB
Tits has shown that a finitely generated matrix group either contains a nonabelian free group or has a solvable subgroup of finite index. We give a polynomial time algorithm for deciding which of these two conditions holds for a given finitely generated matrix group over an algebraic number field. N