Differences between revisions 13 and 23 (spanning 10 versions)
Revision 13 as of 2010-12-08 21:41:36
Size: 2748
Editor: AlysonDeines
Comment:
Revision 23 as of 2010-12-08 22:12:19
Size: 2552
Editor: Kate Stange
Comment:
Deletions are marked like this. Additions are marked like this.
Line 12: Line 12:
    * this appears to be done here: [[attachment:Computing N for Hyperelliptic curve.sws]]
    * need data to check that this is correct.
    * for what range of primes is this code reasonable?
Line 13: Line 16:
  * make it really, really fast.   * make it really, really fast (cython).
Line 24: Line 27:
  * smalljac See the [[days26/Stange Project|Project Page]]. Subprojects are:
Line 26: Line 29:
      * make smalljac code usable from Python (involves Cython); see [[http://code.google.com/p/purplesage/issues/detail?id=13|this psage issue]].

      * use code:
 
          - replicate and extend data in Kate's talk
 
          - maybe try genus 2 analogue?
  * make smalljac code usable from Python (involves Cython)
Line 35: Line 32:

      * there's a [[http://trac.sagemath.org/sage_trac/attachment/ticket/8485/trac_8485.patch|ticket]] that has only partial implementation (cubic residue of rational prime and element of Q(sqrt(-3))) -- not at all a general implementation

      * there are artin symbols etc. -- big machinery

      * we think a fast independent implementation of the cubic (and sextic) residue symbol is worthwhile

      * what does SAGE do to compute quadratic residue symbols?
Line 49: Line 38:
PEOPLE: Jennifer B., Jennifer P., Jennifer J. PEOPLE: Jennifer B., Jennifer P., Jennifer J., Bianca
Line 51: Line 40:
  * Decide if curve is attached to a modular form, and if so find it, then use that to compute L-series.   * Decide if curve is attached to a modular form, and if so find it, then use that to compute L-series (use Sturm bound -- see paper of Ribet with appendix by Agashe/Stein)

  * Need the analogue of Tate's algorithm to get from the Namikawa-Ueno classification to the Euler factor at the bad primes
Line 74: Line 65:
PEOPLE: Needs people!

PROJECT GROUPS

Computing the Cartier operator acting on 1-forms

PEOPLE: Rachel P., Aly, Gagan, Anja, Sarah, Marina, Kate

  • See this page.

  • sage worksheet that is slow and just implements algorithm (correctly!)
  • make it really, really fast (cython).
  • get included in sage itself
  • make a big table or something? Rachel: "I would love to find a curve with p-rank 0 and a-number 1. I did genus 4 and p=3."

Making Drew Sutherland's smalljac code usable in Sage and extending Kate's data

PEOPLE: Kate, William S., Lola, Aly, Erin, Bianca

See the Project Page. Subprojects are:

  • make smalljac code usable from Python (involves Cython)
  • cubic and sextic residue symbol
  • explicit calculation of Grossencharacters (aka Hecke characters).

Computing L-series of Jacobians of Certain Hyperelliptic Curves

PEOPLE: Jennifer B., Jennifer P., Jennifer J., Bianca

  • Decide if curve is attached to a modular form, and if so find it, then use that to compute L-series (use Sturm bound -- see paper of Ribet with appendix by Agashe/Stein)
  • Need the analogue of Tate's algorithm to get from the Namikawa-Ueno classification to the Euler factor at the bad primes
  • Plug L-series into Dokchitser and get numbers.
  • Make a table. Starting with "van Wamelen"'s table. See also Kohel's tables.

  • Incorporate Robert Bradshaw's code into Purple Sage. http://code.google.com/p/purplesage/issues/detail?id=14

Computing in the class group of non-maximal orders of quadratic imaginary fields

PEOPLE: William S., Bianca,

  • Make a list of what you want to be able to do:
  • List why Magma/PARI aren't good enough (bugs, issues, speed, etc.)
  • Write really really fast code to implement some of this.

Sara's (mostly Combinatorics) wishlist

PEOPLE: Needs people!

  • Better index of software
  • sbcl in Sage
  • Quasisymmetric function bases
  • hyperplane arrangements
  • wikipedia and Sage pages linked to each other

days26/projects (last edited 2010-12-10 19:57:07 by AlysonDeines)