Nils Bruin
Simon Fraser University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Nils Bruin.
Mathematics of Computation | 2009
Nils Bruin; Michael Stoll
We describe an algorithm that determines a set of unramified covers of a given hyperelliptic curve, with the property that any rational point will lift to one of the covers. In particular, if the algorithm returns an empty set, then the hyperelliptic curve has no rational points. This provides a relatively efficiently tested criterion for solvability of hyperelliptic curves. We also discuss applications of this algorithm to curves of genus 1 and to curves with rational points.
Experimental Mathematics | 2008
Nils Bruin; Michael Stoll
In this paper we gather experimental evidence related to the question of deciding whether a curve has a rational point. We consider all genus-2 curves over ℚ given by an equation y 2 = f(x) with f a square-free polynomial of degree 5 or 6, with integral coefficients of absolute value at most 3. For each of these roughly 200 000 isomorphism classes of curves, we decide whether there is a rational point on the curve by a combination of techniques that are applicable to hyperelliptic curves in general. In order to carry out our project, we have improved and optimized some of these techniques. For 42 of the curves, our result is conditional on the Birch and Swinnerton-Dyer conjecture or on the generalized Riemann hypothesis.
Proceedings of The London Mathematical Society | 2006
Michael A. Bennett; Nils Bruin; Kalman Gyory; Lajos Hajdu
We show that if
Transactions of the American Mathematical Society | 2005
Nils Bruin; E. V. Flynn
k
algorithmic number theory symposium | 2000
Nils Bruin
is a positive integer, then there are, under certain technical hypotheses, only finitely many coprime positive
arXiv: Number Theory | 2016
Nils Bruin; Bjorn Poonen; Michael Stoll
k
Compositio Mathematica | 2008
Nils Bruin
-term arithmetic progressions whose product is a perfect power. If
Lms Journal of Computation and Mathematics | 2007
M.J. Bright; Nils Bruin; E. V. Flynn; A. Logan
4 \leq k \leq 11
Archive | 2006
Nils Bruin
, we obtain the more precise conclusion that there are, in fact, no such progressions. Our proofs exploit the modularity of Galois representations corresponding to certain Frey curves, together with a variety of results, classical and modern, on solvability of ternary Diophantine equations. As a straightforward corollary of our work, we sharpen and generalize a theorem of Sander on rational points on superelliptic curves.
Mathematics of Computation | 2004
Nils Bruin
In this article, we give a way of constructing an unramified Galois-cover of a hyperelliptic curve. The geometric Galois-group is an elementary abelian 2-group. The construction does not make use of the embedding of the curve in its Jacobian, and it readily displays all subcovers. We show that the cover we construct is isomorphic to the pullback along the multiplication-by-2 map of an embedding of the curve in its Jacobian. We show that the constructed cover has an abundance of elliptic and hyperelliptic subcovers. This makes this cover especially suited for covering techniques employed for determining the rational points on curves. In particular the hyperelliptic subcovers give a chance for applying the method iteratively, thus creating towers of elementary abelian 2-covers of hyperelliptic curves. As an application, we determine the rational points on the genus 2 curve arising from the question of whether the sum of the first n fourth powers can ever be a square. For this curve, a simple covering step fails, but a second step succeeds.