Numerical verification of BSD

Similar documents
Rational Points on Curves in Practice. Michael Stoll Universität Bayreuth Journées Algophantiennes Bordelaises Université de Bordeaux June 8, 2017

Isogeny invariance of the BSD conjecture

How to compute regulators using Arakelov intersection theory

A p-adic Birch and Swinnerton-Dyer conjecture for modular abelian varieties

Rational Points on Curves of Genus 2

Introduction to Arithmetic Geometry

Elliptic curves over function fields 1

TAMAGAWA NUMBERS OF ELLIPTIC CURVES WITH C 13 TORSION OVER QUADRATIC FIELDS

A p-adic Birch and Swinnerton-Dyer conjecture for modular abelian varieties

The Birch & Swinnerton-Dyer conjecture. Karl Rubin MSRI, January

Rational points on curves and tropical geometry.

Quadratic points on modular curves

Equations for Hilbert modular surfaces

LECTURE 2 FRANZ LEMMERMEYER

Higher genus curves and the inverse Galois problem

Computations with Coleman integrals

The Sato-Tate conjecture for abelian varieties

RAMIFIED PRIMES IN THE FIELD OF DEFINITION FOR THE MORDELL-WEIL GROUP OF AN ELLIPTIC SURFACE

Counting points on genus 2 curves over finite

Plane quartics and. Dedicated to Professor S. Koizumi for his 70th birthday. by Tetsuji Shioda

Modern Number Theory: Rank of Elliptic Curves

Computing the image of Galois

Elliptic Curves over Q

Verification of the Birch and Swinnerton-Dyer Conjecture for Specific Elliptic Curves

Frobenius Distributions

An LMFDB perspective on motives David P. Roberts University of Minnesota, Morris

Tables of elliptic curves over number fields

Equidistributions in arithmetic geometry

Hanoi lectures on the arithmetic of hyperelliptic curves

Cover Page. The handle holds various files of this Leiden University dissertation.

Diophantine equations and beyond

The GL 2 main conjecture for elliptic curves without complex multiplication. by Otmar Venjakob

10. Smooth Varieties. 82 Andreas Gathmann

Parametrizations for Families of ECM-Friendly Curves

Infinite rank of elliptic curves over Q ab and quadratic twists with positive rank

FINITE GROUPS AND EQUATIONS OVER FINITE FIELDS A PROBLEM SET FOR ARIZONA WINTER SCHOOL 2016

Isogeny graphs, modular polynomials, and point counting for higher genus curves

this to include the explicit maps, please do so!

Torsion points on elliptic curves and gonalities of modular curves

On squares in Lucas sequences

Polynomial Selection Using Lattices

p-adic Integration on Curves of Bad Reduction

Calcul d indice et courbes algébriques : de meilleures récoltes

Igusa Class Polynomials

Explicit Kummer Varieties for Hyperelliptic Curves of Genus 3

Introduction to Elliptic Curves

On K2 T (E) for tempered elliptic curves

On Q-derived Polynomials

Igusa Class Polynomials

Arithmetic Progressions Over Quadratic Fields

PARTIAL FRACTIONS. Introduction

Integral points of a modular curve of level 11. by René Schoof and Nikos Tzanakis

On elliptic curves in characteristic 2 with wild additive reduction

COMPUTING GALOIS GROUPS WITH GENERIC RESOLVENT POLYNOMIALS

Edwards Curves and the ECM Factorisation Method

Algebraic Geometry: Elliptic Curves and 2 Theorems

arxiv: v1 [math.nt] 31 Dec 2011

Elliptic Curves, Factorization, and Cryptography

Constructing genus 2 curves over finite fields

Elliptic Curves and Public Key Cryptography

Computing a Lower Bound for the Canonical Height on Elliptic Curves over Q

Genus 2 Curves of p-rank 1 via CM method

Elliptic Curves and Mordell s Theorem

AN INTRODUCTION TO MODULI SPACES OF CURVES CONTENTS

The Canonical Sheaf. Stefano Filipazzi. September 14, 2015

arxiv: v1 [math.ag] 7 Apr 2015

Counting points on smooth plane quartics

Section VI.33. Finite Fields

Numerical computation of endomorphism rings of Jacobians

Partial Fractions. June 27, In this section, we will learn to integrate another class of functions: the rational functions.

What is a motive? David P. Roberts University of Minnesota, Morris. September 10, 2015

A non-abelian conjecture of Birch and Swinnerton-Dyer type

LECTURE 7, WEDNESDAY

Counting Points on Curves using Monsky-Washnitzer Cohomology

DISSERTATION ARTIN-SCHREIER CURVES. Submitted by Shawn Farnell Department of Mathematics

Points of Finite Order

Elliptic Curves Spring 2013 Lecture #12 03/19/2013

Rational tetrahedra with edges in geometric progression

Chapter 5. Linear Algebra. Sections A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 45

SQUARES FROM SUMS OF FIXED POWERS. Mark Bauer and Michael A. Bennett University of Calgary and University of British Columbia, Canada

A Database of Elliptic Curves with Z/2Z Z/8Z torsion

Counting points on hyperelliptic curves

Combinatorics and geometry of E 7

Integration of Rational Functions by Partial Fractions

Computation of zeta and L-functions: feasibility and applications

On symmetric square values of quadratic polynomials

Chapter 5. Linear Algebra. A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form

Hyperelliptic curves

Pairing-Friendly Elliptic Curves of Prime Order

Tutorial on Groups of finite Morley rank

Explicit isogenies and the Discrete Logarithm Problem in genus three

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 43

Pade Approximations and the Transcendence

VARIETIES WITHOUT EXTRA AUTOMORPHISMS II: HYPERELLIPTIC CURVES

GALOIS GROUPS OF CUBICS AND QUARTICS (NOT IN CHARACTERISTIC 2)

Good reduction of the Brauer Manin obstruction

Kummer Surfaces. Max Kutler. December 14, 2010

n P say, then (X A Y ) P

Transcription:

Numerical verification of BSD for hyperelliptics of genus 2 & 3, and beyond... Raymond van Bommel (Universiteit Leiden) PhD project under supervision of: David Holmes (Leiden) Fabien Pazuki (Bordeaux/Copenhagen) 28 March 2017

Outline In Magma the author implemented an algorithm to numerically verify BSD for the Jacobian J of an hyperelliptic curve C/Q of higher genus, i.e. the algorithm calculates lim s 1 (s 1) r L(J, s), the real period P J, the regulator R J, the Tamagawa numbers c p, and the size of J(Q) tors, then it uses the BSD formula lim (s s 1 1) r L(J, s) = P JR J X(J) p c p J(Q) tors 2 to predict the size of X(J).

List of results The algorithm confirmed BSD (up to X) for: all elliptic curves y 2 = x 3 + ax + b with a, b { 15,..., 15}, comparing it with existing routines in Magma; most hyperelliptic curves of genus 2 with low conductor from the Empirical evidence paper (Flynn et al., 2001), comparing it with the results from this paper; all 300 hyperelliptics C : y 2 = x 5 + ax 4 + bx 3 + cx 2 + dx + e with a, b, c, d, e { 10,..., 10} and (C) 10 5, except for 30 examples; 29 hyperelliptics curves of genus 3 (verification up to squares) C : y 2 = x 7 + ax 6 + bx 5 + cx 4 + dx 3 + ex 2 + fx + g with a, b, c, d, e, f, g { 3,..., 3} and (C) 10 7. In all cases, except for the ones already considered by Flynn et al., the predicted order of X(J) is 1.

List of exceptions The algorithm failed for several examples for which no regular model could be computed by Magma at some prime p of bad reduction; for genus 3: some examples for which the conductor was too big, which prolongs the calculation of the L-function and the period; the curve x 5 4x 4 + 8x 3 8x 2 + 4x 1 for which the height code takes too long to excute, for reasons still unknown to the author; the curve x 5 3x 4 + 6x 3 6x 2 + 4x 1 for which the L-function code takes too long to execute, for reasons still unkown to the author.

Runtimes We recorded the following runtimes. Here H 1 is one of the curves from the Empirical evidence paper with X 1, conductor 125 and (H 1 ) = 5 16. Moreover, H 2 is of genus 2 with (H 2 ) = 62720, and H 3 is of genus 3 with (H 3 ) = 1523712. H 1 (rk 0) H 2 (rk 1) H 3 (rk 1) lim s 1 (s 1) r L(J, s) 8.930 7.520 173.5 period P J 36.33 34.34 64.46 regulator R j 0.930 142.6 294.23 Tamagawa numbers c p 0.040 0.040 0.070 J(Q) tors 0.130 0.010 N/A Runtime in seconds

How to calculate lim s 1 (s 1) r L(J, s)? The algebraic rank of J can be computed by Magma, by computing an upper bound, using 2-Selmer groups, and a lower bound, by looking for points. In practice, these bounds seemed to agree for our examples. The L-function and its derivatives can be evaluated at s = 1 using code by Tim and Vladimir Dokchitser (and possibly others). This routine uses the RegularModel routine in Magma. Problem: the runtime seems to increase quickly as the conductor increases, as it uses the functional equation for the evaluation. Problem: the algorithm assumes the existence of an analytic continuation together with a functional equation, but does not prove this.

How to calculate the real period P J? (1/2) For a standard basis dx y, xdx y,..., xg 1 dx y of the differentials, and for a symplectic basis γ 1,..., γ 2g of H 1 (J(C), Z) calculated by Magma, there is a Magma routine BigPeriodMatrix due to Van Wamelen that calculates the matrix ( ) x M = j 1 dx γi y. i=1,...,2g, j=1,...g The columns of M + M span a lattice inside R g. The covolume of this lattice is the real period, up to a certain correction factor. The differential dx y... xg 1 dx y is not a Néron differential. To correct for this, we need to find how far it is away from being a Néron differential.

How to calculate the real period P J? (2/2) For the primes of good reduction, it is alright, but for the primes p of bad reduction we do the following calculation (cf. Flynn et al.): 1. we calculate a regular model C/Z (p) ; 2. for each i = 0,..., g 1 and each irreducible component E of the special fibre C Fp, we check if xi dx y has a pole on E and multiply by p if necessary; 3. for each linear combination D = g 1 i=0 c i xi dx y, with c i {0,..., p 1} not all zero, and each component E of C Fp, we check if D vanishes on E and adjust the basis if necessary. Problem: step 3 takes a lot of time: for p g differentials a non-trivial calculation had to be done. It should not be too hard to overcome this problem.

How to calculate the regulator R J? We calculate the algebraic rank as before and try to find generators for the free part of J(Q) tors. For higher genus hyperelliptic curves, the height pairing can then be calculated using techniques from Arakelov theory. The algorithm and its implementation are due to Holmes and Müller. Problem: the bounds up to which height we need to find all points might be a bit big. In practice, the heights needed seem to be very small. In theory, it might happen that we get an error factor, which is a rational square. Problem: the higher the genus gets, the harder it is find all points of low height. For genus 2, it is very doable, for higher genus it gets impractical. For genus 3, we at least always found a subgroup of full rank.

How to calculate the Tamagawa numbers c p? To calculate the Tamagawa number for a bad prime p, we compute a regular model C/Z (p) of C. The Magma code gives an explicit respresentation with charts and equations, which is a bit cumbersome to access. We calculate the action of the absolute Galois group on the component group, by calculating the action of the Frobenius on the explicit equations. Then the Tamagawa number is the size of the Galois-invariant subgroup of the component group.

How to calculate J(Q) tors? Here we combine the following two approaches. For genus 2, this is already implemented in Magma. As before, we calculate the points in J(Q) up to a certain height and look for torsion points. This gives a lower bound for the torsion subgroup. We calculate the reduction J p of J modulo a bunch of small primes p of good reduction. The prime-to-p-part of the torsion group injects into J p (F p ). This gives an upper bound. In most cases, the upper and lower bound coincided. In those cases it did not (genus 3), this might induce an error factor equal to a rational square in the BSD formula.

Ideas for the future In the future, we hope to extend these methods to numerically verify (possibly up to squares, and up to X) BSD for some smooth plane quartics. Right now, there are a lot of curves for which the verification cannot be done, because Magma cannot compute a regular model for these. This happens when a component in the special fibre has to be blown up and this component is not defined over F p. Another idea could be to extend the RegularModel code to also cope with these cases. The author did not extensively research the feasibility of this suggestion.

The end Questions / comments / discussion?