Differences between revisions 3 and 6 (spanning 3 versions)
Revision 3 as of 2009-11-28 20:11:32
Size: 1962
Editor: was
Comment:
Revision 6 as of 2009-11-28 21:13:36
Size: 2453
Editor: was
Comment:
Deletions are marked like this. Additions are marked like this.
Line 14: Line 14:
== Implement Tate's algorithm for elliptic curves over the function field $\mathbf{F}_p(t)$. == == Implement Tate's algorithm for elliptic curves over the function field F_p(t) ==
Line 19: Line 19:
== Implement computation of the 3-Selmer rank of an elliptic curve over $\mathbf{Q}$. == == Implement computation of the 3-Selmer rank of an elliptic curve over QQ ==
Line 24: Line 24:
== Compute statistics about distribution of Heegner divisors and Kolyvagin divisors modulo primes $p$. == == Compute statistics about distribution of Heegner divisors and Kolyvagin divisors modulo primes p ==
Line 29: Line 29:
== Create a table of images of Galois representations, for elliptic curves and/or Jacobians, in some range. == == Create a table of images of Galois representations, for elliptic curves and/or Jacobians, in some range ==
Line 33: Line 33:
== Fully implement and optimize variant of Watkins's algorithm for fast computation of Heegner points. == Drew Sutherland remarks:
{{{
Hi William,

I would definitely be motivated to work on the table of Galois images project that you suggested in your list. I am currently rerunning my previous computations on the Stein-Watkins database using an improved version of the algorithm (just for the mod ell case at the moment, I still want to tweak the mod ell^k code some more). It would be great to get all this data organized and accessible in a useful form, especially while everything is fresh in my mind.

Drew
}}}



== Fully implement and optimize variant of Watkins's algorithm for fast computation of Heegner points ==
Line 37: Line 48:
== Implement code to compute the asymptotic distribution of Kolyvagin classes (from Jared Weinstein's talk); this should be pretty easy, though generalizing to higher rank may be challenging. == == Implement code to compute the asymptotic distribution of Kolyvagin classes (from Jared Weinstein's talk); this should be pretty easy, though generalizing to higher rank may be challenging ==
Line 41: Line 52:
== Verify Kolyvagin's conjecture for a specific rank 3 curve. == == Verify Kolyvagin's conjecture for a specific rank 3 curve ==
Line 45: Line 56:
== Implement an algorithm in Sage to compute Stark-Heegner points. == == Implement an algorithm in Sage to compute Stark-Heegner points ==
Line 49: Line 60:
== Compute the higher Heegner point $y_5$ on the curve 389a '''provably correctly'''. == == Compute the higher Heegner point y_5 on the curve 389a provably correctly ==
Line 53: Line 64:
== Compute special values of the Gross-Zagier $L$-function $L(f,\chi,s)$. == == Compute special values of the Gross-Zagier L-function L(f,chi,s) ==
Line 57: Line 68:
== Implement something toward the Pollack et al. overconvergent modular symbols algorithm. == == Implement something toward the Pollack et al. overconvergent modular symbols algorithm ==
Line 59: Line 70:
 People: ''Robert Pollack''  People: ''Robert Pollack'', Avner Ash

Sage Days 18 Coding Sprint Projects

Compute regulators of elliptic curves over function fields

  • People: Sal Baig

Is there an algorithm to enumerate all elliptic curves over a function field of a given conductor?

  • People: Sal Baig, William Stein

Implement Tate's algorithm for elliptic curves over the function field F_p(t)

  • People: Sal Baig, David Roe (?)

Implement computation of the 3-Selmer rank of an elliptic curve over QQ

  • People: Robert Miller, William Stein

Compute statistics about distribution of Heegner divisors and Kolyvagin divisors modulo primes p

  • People: William Stein, Dimitar Jetchev

Create a table of images of Galois representations, for elliptic curves and/or Jacobians, in some range

  • People: Drew Sutherland, William Stein

Drew Sutherland remarks:

Hi William,

I would definitely be motivated to work on the table of Galois images project that you suggested in your list. I am currently rerunning my previous computations on the Stein-Watkins database using an improved version of the algorithm (just for the mod ell case at the moment, I still want to tweak the mod ell^k code some more). It would be great to get all this data organized and accessible in a useful form, especially while everything is fresh in my mind.

Drew

Fully implement and optimize variant of Watkins's algorithm for fast computation of Heegner points

  • People: William Stein, Robert Bradshaw

Implement code to compute the asymptotic distribution of Kolyvagin classes (from Jared Weinstein's talk); this should be pretty easy, though generalizing to higher rank may be challenging

  • People: Jared Weinstein

Verify Kolyvagin's conjecture for a specific rank 3 curve

  • People: William Stein

Implement an algorithm in Sage to compute Stark-Heegner points

  • People: Mathew Greenberg

Compute the higher Heegner point y_5 on the curve 389a provably correctly

  • People: Robert Bradshaw, William Stein

Compute special values of the Gross-Zagier L-function L(f,chi,s)

  • People: Robert Bradshaw

Implement something toward the Pollack et al. overconvergent modular symbols algorithm

  • People: Robert Pollack, Avner Ash

Compute a Heegner point on the Jacobian of a genus 2 curve

  • People: ?

dayscambridge2/sprints (last edited 2009-12-23 06:38:37 by was)