Algorithms for the Tits alternative and related problems
Preprint
Abstract
We present an algorithm that decides whether a finitely generated linear group over an infinite field is solvable-by-finite: a computationally effective version of the Tits alternative. We also give algorithms to decide whether the group is nilpotent-by-finite, abelian-by-finite, or central-by-finite. Our algorithms have been implemented in MAGMA and are publicly available.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- A practical model for computation with matrix groupsJournal of Symbolic Computation, 2015
- Deciding finiteness of matrix groups in positive characteristicJournal of Algebra, 2009
- On Jordan's theorem for complex linear groupsJournal of Group Theory, 2007
- Computing in Nilpotent Matrix GroupsLMS Journal of Computation and Mathematics, 2006
- Computing polycyclic presentations for polycyclic rational matrix groupsJournal of Symbolic Computation, 2005
- Handbook of Computational Group Theory2005
- Practical Algorithms for Polycyclic Matrix GroupsJournal of Symbolic Computation, 1999
- The algorithmic theory of polycyclic-by-finite groupsJournal of Algebra, 1991
- The Orbit-Stabilizer Problem for Linear GroupsCanadian Journal of Mathematics, 1985
- Free subgroups in linear groupsJournal of Algebra, 1972