• Categoric Aspects of Authentication 

      [OWP-2012-05] Schillewaert, Jeroen; Thas, Koen (Mathematisches Forschungsinstitut Oberwolfach, 2012-04-24)
    • 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 ...
    • Logical Relations for Partial Features and Automatic Differentiation Correctness 

      [OWP-2023-09] Lucatelli Nunes, Fernando; Vákár, Matthijs (Mathematisches Forschungsinstitut Oberwolfach, 2023-06-19)
      We present a simple technique for semantic, open logical relations arguments about languages with recursive types, which, as we show, follows from a principled foundation in categorical semantics. We demonstrate how it can ...
    • On Vietoris-Rips Complexes of Ellipses 

      [OWP-2017-11] Adamaszek, Michal; Adams, Henry; Reddy, Samadwara (Mathematisches Forschungsinstitut Oberwolfach, 2017-04-25)
      For $X$ a metric space and $r > 0$ a scale parameter, the Vietoris–Rips complex $VR_<(X; r)$ (resp. $VR_≤(X; r)$) has $X$ as its vertex set, and a finite subset $\sigma \subseteq X$ as a simplex whenever the diameter of ...