Algorithms for the Tits alternative and related problems
Group Theory
2019-05-15 v1
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.
Cite
@article{arxiv.1905.05234,
title = {Algorithms for the Tits alternative and related problems},
author = {A. S. Detinko and D. L. Flannery and E. A. O'Brien},
journal= {arXiv preprint arXiv:1905.05234},
year = {2019}
}