Barry Mazur famously classified the finitely many groups that can occur as a torsion subgroup of an elliptic curve over the rationals. This thesis deals with generalizations of this to higher... Show moreBarry Mazur famously classified the finitely many groups that can occur as a torsion subgroup of an elliptic curve over the rationals. This thesis deals with generalizations of this to higher degree number fields. Merel proved that for all integers d one has that the number of isomorphsim classes of torsion groups of elliptic curves over number fields of degree d is finite. This thesis consists of 4 chapters, the first is introductory and the other tree are research articles. Chapter two deals with the computation of gonalities of modular curves, and the application of these computations to the question which cyclic subgroups can occur as the torsion subgroup of infinitely many non-isomorphic elliptic curves over number fields of degree <7. In the second chapter a general theory for finding rational points on symmetric powers of curves is developed that is similar to symmetric power Chabauty. Application of this theory to symmetric powers of modular curves allows us to determine which primes can divide the order of the torsion subgroup of an elliptic curve over a number field of degree <7. The last chapter studies elliptic curve with a point of order 17 over a number field of degree 4. Show less
A common theme in the research on rational points on varieties is: investigating under which conditions rational points are dense with respect to a chosen topology. We prove several existence... Show moreA common theme in the research on rational points on varieties is: investigating under which conditions rational points are dense with respect to a chosen topology. We prove several existence results concerning K3 surfaces defined over the rational numbers with a dense set of rational points with respect to the p-adic topology, for a prime number p, and product topologies arising from these Show less
This thesis is about arithmetic, analytic and algorithmic aspects of modular curves and modular forms. The arithmetic and analytic aspects are linked by the viewpoint that modular curves are... Show moreThis thesis is about arithmetic, analytic and algorithmic aspects of modular curves and modular forms. The arithmetic and analytic aspects are linked by the viewpoint that modular curves are examples of arithmetic surfaces. Therefore, Arakelov theory (intersection theory on arithmetic surfaces) occupies a prominent place in this thesis. Apart from this, a substantial part of it is devoted to studying modular curves over finite fields, and their Jacobian varieties, from an algorithmic viewpoint. The end product of this thesis is an algorithm for computing modular Galois representations. These are certain two-dimensional representations of the absolute Galois group of the rational numbers that are attached to Hecke eigenforms over finite fields. The running time of our algorithm is (under minor restrictions) polynomial in the length of the input. This main result is a generalisation of that of work of Jean-Marc Couveignes, Bas Edixhoven et al. Several intermediate results are developed in sufficient generality to make them of interest to the study of modular curves and modular forms in a wider sense. Show less
The theory of complex multiplication makes it possible to construct certain class fields and abelian varieties. The main theme of this thesis is making these constructions explicit for the case... Show moreThe theory of complex multiplication makes it possible to construct certain class fields and abelian varieties. The main theme of this thesis is making these constructions explicit for the case where the abelian varieties have dimension 2. Chapter I is an introduction to complex multiplication, and shows that a general result of Shimura can be improved for degree-4 CM-fields. Chapter II gives an algorithm for computing class polynomials for quartic CM-fields, based on an algorithm of Spallek. We make the algorithm more explicit, and use Goren and Lauter___s recent bounds on the denominators of the coefficients, which yields the first running time bound and proof of correctness of an algorithm computing these polynomials. Chapter III studies and computes the irreducible components of the modular variety of abelian surfaces with CM by a given primitive quartic CM-field. We adapt the algorithm of Chapter II to compute these components. Chapters IV and V construct certain `Weil numbers'. They have properties that are number theoretic in nature and are motivated by cryptography. Chapter IV is joint work with David Freeman and Peter Stevenhagen. Chapter V is joint work with Laura Hitt O'Connor, Gary McGuire, and Michael Naehrig. Show less
Factorization methods, such as the quadratic sieve and the number field sieve, spend a lot of time on the sieving step, in which the necessary relations are collected for factoring the given number... Show moreFactorization methods, such as the quadratic sieve and the number field sieve, spend a lot of time on the sieving step, in which the necessary relations are collected for factoring the given number N. Relations are smooth or k-semismooth numbers (numbers with either all prime factors below some bound or all with the exception of at most k prime factors that do not exceed a second bound) or pairs of these type of numbers. In this thesis, we predict the amount of k-semismooth numbers needed to factor N, based on asymptotic approximation formulas (these formulas generalize the published results), and compare them with the amount of k-semismooth numbers found during the factorization of N. Furthermore, for the number field sieve we propose a method for predicting the number of necessary relations for factoring N with given parameters, and the corresponding sieving time. The basic idea is to do a small but representative amount of sieving and analyze the relations in this sample. We randomly generate relations according to the relevant distribution as observed in the sample and process these relations. Experiments show that our predictions of the number of necessary relations are within 2% of the number of relations needed in the real factorization. Show less