3 citations · 3 across the 9 of their papers we have counts for
9 papers
Algorithms for computing with nilpotent matrix groups over infinite domains
A. S. Detinko, D. L. Flannery
We develop methods for computing with matrix groups defined over a range of infinite domains, and apply those methods to the design of algorithms for nilpotent groups. In particula…
Algorithms for arithmetic groups with the congruence subgroup property
A. S. Detinko, D. L. Flannery, A. Hulpke
We develop practical techniques to compute with arithmetic groups for . Our approach relies on constructing a principal congruence subgroup i…
Deciding finiteness of matrix groups in positive characteristic
A. S. Detinko, D. L. Flannery, E. A. O'Brien
We present a new algorithm to decide finiteness of matrix groups defined over a field of positive characteristic. Together with previous work for groups in zero characteristic, thi…
Algorithms for the Tits alternative and related problems
A. S. Detinko, D. L. Flannery, E. A. O'Brien
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 alterna…
Recognizing finite matrix groups over infinite fields
A. S. Detinko, D. L. Flannery, E. A. O'Brien
We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finite…
Algorithms for linear groups of finite rank
A. S. Detinko, D. L. Flannery, E. A. O'Brien
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üfer rank of . This yields…