3 citations · 6 across the 7 of their papers we have counts for
5 papers · 1 filter
Universal Covers of Finite Groups
Heiko Dietrich, Alexander Hulpke
Motivated by quotient algorithms, such as the well-known -quotient or solvable quotient algorithms, we describe how to compute extensions of a finite group by a d…
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…
Experimenting with symplectic hypergeometric monodromy groups
A. S. Detinko, D. L. Flannery, A. Hulpke
We present new computational results for symplectic monodromy groups of hypergeometric differential equations. In particular, we compute the arithmetic closure of each group, somet…