A. S. Detinko, D. L. Flannery, E. A. O'Brien
Published 2019-05-13Version 1
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.
Journal: Journal of Algebra 344 (2011), 397-406
A Tits alternative for $\mathbb{R}$-buildings of type $\tilde{A}_2$
Asymptotic invariants, complexity of groups and related problems
A Tits alternative for topological full groups
![QR code for arXiv:1905.05234 [math.GR]](http://oss.arxitics.com/images/favicon.svg)