Abstract
We present an algorithm to decide whether a finitely generated linear group over an infinite field is solvable-by-finite, thereby obtaining a computationally effective version of the Tits alternative. We also give algorithms to decide whether the group is nilpotentby-finite, abelian-by-finite, or central-by-finite. Implementations of the algorithms are publicly available in Magma.
| Original language | English |
|---|---|
| Pages (from-to) | 397-406 |
| Number of pages | 10 |
| Journal | Journal of Algebra |
| Volume | 344 |
| Issue number | 1 |
| Early online date | 12 Aug 2011 |
| DOIs | |
| Publication status | Published - 15 Oct 2011 |
| Externally published | Yes |