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