arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1905.04546math.GR
收藏

Algorithms for linear groups of finite rank

A. S. Detinko, D. L. Flannery, E. A. O'Brien

英文摘要:

Let $G$ be a finitely generated solvable-by-finite linear group. We present an algorithm to compute the torsion-free rank of $G$ and a bound on the Prüfer rank of $G$. This yields in turn an algorithm to decide whether a finitely generated subgroup of $G$ has finite index. The algorithms are implemented in MAGMA for groups over algebraic number fields.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑