|
Size: 1962
Comment:
|
Size: 1915
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. == | == Fully implement and optimize variant of Watkins's algorithm for fast computation of Heegner points == |
| Line 37: | Line 37: |
| == 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 41: |
| == Verify Kolyvagin's conjecture for a specific rank 3 curve. == | == Verify Kolyvagin's conjecture for a specific rank 3 curve == |
| Line 45: | Line 45: |
| == Implement an algorithm in Sage to compute Stark-Heegner points. == | == Implement an algorithm in Sage to compute Stark-Heegner points == |
| Line 49: | Line 49: |
| == 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 53: |
| == 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 57: |
| == Implement something toward the Pollack et al. overconvergent modular symbols algorithm. == | == Implement something toward the Pollack et al. overconvergent modular symbols algorithm == |
Sage Days 18 Coding Sprint Projects
Contents
-
Sage Days 18 Coding Sprint Projects
- Compute regulators of elliptic curves over function fields
- Is there an algorithm to enumerate all elliptic curves over a function field of a given conductor?
- Implement Tate's algorithm for elliptic curves over the function field F_p(t)
- Implement computation of the 3-Selmer rank of an elliptic curve over QQ
- Compute statistics about distribution of Heegner divisors and Kolyvagin divisors modulo primes p
- Create a table of images of Galois representations, for elliptic curves and/or Jacobians, in some range
- Fully implement and optimize variant of Watkins's algorithm for fast computation of Heegner points
- 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
- Verify Kolyvagin's conjecture for a specific rank 3 curve
- Implement an algorithm in Sage to compute Stark-Heegner points
- Compute the higher Heegner point y_5 on the curve 389a provably correctly
- Compute special values of the Gross-Zagier L-function L(f,chi,s)
- Implement something toward the Pollack et al. overconvergent modular symbols algorithm
- Compute a Heegner point on the Jacobian of a genus 2 curve
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
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
Compute a Heegner point on the Jacobian of a genus 2 curve
- People: ?