764 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- University College DublinIE182 papers
- Center for Astrophysics Harvard & SmithsonianUS167 papers
- Purdue University West LafayetteUS154 papers
- McGill UniversityCA153 papers
- University of California, Santa CruzUS151 papers
- Washington University in St. LouisUS150 papers
- Iowa State UniversityUS149 papers
- University of California, Los AngelesUS149 papers
- University of UtahUS149 papers
- Columbia UniversityUS138 papers
- Munster Technological UniversityIE138 papers
- University of ChicagoUS138 papers
6 papers · 2 filters
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…
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…
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…