3 citations · 5 across the 3 of their papers we have counts for
4 papers
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…
Constructive Membership Tests in Some Infinite Matrix Groups
Alexander Hulpke
We describe algorithms and heuristics that allow us to express arbitrary elements of SLn (Z) and Sp2n (Z) as products of generators in particular "standard" generating sets. For el…
The strong approximation theorem and computing with linear groups
Alla Detinko, Dane Flannery, Alexander Hulpke
We obtain a computational realization of the strong approximation theorem. That is, we develop algorithms to compute all congruence quotients modulo rational primes of a finitely g…
Finding Intermediate Subgroups
Alexander Hulpke
This article describes a practical approach for determining the lattice of subgroups U < V < G between given subgroups U and G, provided the total number of such subgroups is not t…