12 citations · 39 across the 15 of their papers we have counts for
17 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}(…
Arithmetic in Group Extensions
Alexander Hulpke
We describe a generalization of the concept of a pc presentation that applies to groups with a nontrivial solvable radical. Such a representation can be much more efficient in term…
Zariski density and computing with -integral groups
A. S. Detinko, D. L. Flannery, A. Hulpke
We generalize our methodology for computing with Zariski dense subgroups of and , to accommodate input dense subgroups …
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…
Proving infinite index for a subgroup of matrices
Alexander Hulpke
We show how tools from computational group theory can be used to prove that a subgroup of matrices has infinite index.
The perfect groups of order up to two million
Alexander Hulpke
We enumerate the 15768 perfect groups of order up to , up to isomorphism, thus also completing the missing cases in the prior classification. The work supplements the…