12 citations · 30 across the 19 of their papers we have counts for
19 papers
Algorithms for experimenting with Zariski dense matrix groups over number fields
A. S. Detinko, D. L. Flannery, A. Hulpke
Let be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(…
Nilpotent primitive linear groups over finite fields
A. S. Detinko, D. L. Flannery
We provide a detailed structural description of the nilpotent primitive subgroups of , where is a finite field.
Freeness and -arithmeticity of rational Möbius groups
A. S. Detinko, D. L. Flannery, A. Hulpke
We initiate a new, computational approach to a classical problem: certifying non-freeness of (-generator, parabolic) Möbius subgroups of . The main to…
Locally nilpotent linear groups
A. S. Detinko, D. L. Flannery
We survey aspects of locally nilpotent linear groups. Then we obtain a new classification; namely, we classify the irreducible maximal locally nilpotent subgroups of $\mathrm{GL}(q…
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…