26 citations · 102 across the 28 of their papers we have counts for
37 papers
Arithmetic Information of Rational Elliptic Surfaces, and Shioda's Rank 68 Elliptic Surface
Blair Butler, Andreas-Stephan Elsenhans
The field of definition of the Mordell-Weil group of an elliptic surface defined over is the smallest number field such that all of it…
Computing class groups and unit groups in Magma
Andreas-Stephan Elsenhans, John Voight
We describe the computation of class groups and unit groups of number fields as implemented in Magma (V2.29). After quickly reviewing the main algorithms based on factor bases, rel…
Numerical verification of the Collatz conjecture for billion digit random numbers
Andreas-Stephan Elsenhans
The Collatz conjecture, also known as the 3n+1 problem, is one of the most popular open problems in number theory. In this note, an algorithm for the verification of the Collatz co…
Explicit modularity of K3 surfaces with complex multiplication of large degree
Edgar Costa, Andreas-Stephan Elsenhans, Jörg Jahnel +1
We consider the transcendental motive of three K3 surfaces conjectured to have complex multiplication (CM). Under this assumption, we match these to explicit algebraic Hecke qu…
On the component group of the algebraic monodromy group of a surface
Andreas-Stephan Elsenhans, Jörg Jahnel
We provide a lower bound for the number of components of the algebraic monodromy group in the situation of a surface over a number field . In the CM case, our bound is shar…
Computing Symmetric Normalisers
Andreas-Stephan Elsenhans
The computation of the normaliser of a permutation group in the full symmetric group is an important and hard problem in computational group theory. This article reports on an algo…