Browsing 1 - Oberwolfach Preprints (OWP) by Author "Flannery, Dane"

Now showing items 1-5 of 5

    • Computing Congruence Quotients of Zariski Dense Subgroups 

      [OWP-2018-22] Detinko, Alla; Flannery, Dane; Hulpke, Alexander (Mathematisches Forschungsinstitut Oberwolfach, 2018-10-26)
      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 generated Zariski dense group $H \leq ...

    • Deciding Non-Freeness of Rational Möbius Groups 

      [OWP-2022-07] Detinko, Alla; Flannery, Dane; Hulpke, Alexander (Mathematisches Forschungsinstitut Oberwolfach, 2022-03-22)
      We explore a new computational approach to a classical problem: certifying non-freeness of (2-generator, parabolic) Möbius subgroups of SL(2, $\mathbb{Q}$). The main tools used are algorithms for Zariski dense groups and ...

    • Experimenting with Symplectic Hypergeometric Monodromy Groups 

      [OWP-2019-15] Detinko, Alla; Flannery, Dane; Hulpke, Alexander (Mathematisches Forschungsinstitut Oberwolfach, 2019-05-22)
      We present new computational results for symplectic monodromy groups of hypergeometric differential equations. In particular, we compute the arithmetic closure of each group, sometimes justifying arithmeticity. The results ...

    • Experimenting with Zariski Dense Subgroups 

      [OWP-2017-31] Detinko, Alla; Flannery, Dane; Hulpke, Alexander (Mathematisches Forschungsinstitut Oberwolfach, 2017-10-28)
      We give a method to describe all congruence images of a finitely generated Zariski dense group $H\leq SL(n, \mathbb{R})$. The method is applied to obtain efficient algorithms for solving this problem in odd prime degree ...

    • GAP Functionality for Zariski Dense Groups 

      [OWP-2017-22] Detinko, Alla; Flannery, Dane; Hulpke, Alexander (Mathematisches Forschungsinstitut Oberwolfach, 2017-09-14)
      In this document we describe the functionality of GAP [4] routines for Zariski dense or arithmetic groups that are developed in [1, 2, 3]. The research underlying the software was supported through the programme "Research ...