Algorithms for linear groups of finite rank
Group Theory
2019-05-14 v1
Abstract
Let be a finitely generated solvable-by-finite linear group. We present an algorithm to compute the torsion-free rank of and a bound on the Pr\"{u}fer rank of . This yields in turn an algorithm to decide whether a finitely generated subgroup of has finite index. The algorithms are implemented in MAGMA for groups over algebraic number fields.
Keywords
Cite
@article{arxiv.1905.04546,
title = {Algorithms for linear groups of finite rank},
author = {A. S. Detinko and D. L. Flannery and E. A. O'Brien},
journal= {arXiv preprint arXiv:1905.04546},
year = {2019}
}