Differences between revisions 2 and 7 (spanning 5 versions)
Revision 2 as of 2006-10-02 19:32:22
Size: 78
Editor: wstein
Comment:
Revision 7 as of 2006-10-30 04:07:13
Size: 1159
Editor: wstein
Comment:
Deletions are marked like this. Additions are marked like this.
Line 2: Line 2:
http://sage.math.washington.edu
Line 3: Line 4:
I'm the SAGE BDFL. == Working On ==
Getting SAGE-1.5 released.
Line 5: Line 7:
http://sage.math.washington.edu  1. New PolynomialRing constructor code
    Get rid of the R.< > = PolynomialRing ... notation (fix lots of doctests)
 1. Make all (most) parent structures unique.
 1. Matrices - implement all the classes using the new carefully *designed* structure.
 1. (for matrices) -- the coverage is bad (write way more doctests).


Mostly David H:

 1. extend what I've been working on to ModuleElement, including _sub_ and _neg_
 1. then do _mul_, with fast pathways for both algebra and ring multiplication
 1. use polynomials as a testbed, i.e. give them proper scalar multiplication semantics
 1. after lots of discussion, a fairly hefty rewrite of the coercion module, both to clarify exactly what's supposed to happen, and also to aim for greater efficiency
----------

== Programming ==
 * Modular forms
 * Optimization of exact linear algebra
 * Modular abelian varieties
 * p-adic Modular Forms
 * p-adic L-functions
 * Quaternion algebra arithmetic
== Non-programming ==
 * Fund raising
 * Documentation
 * Organizing workshops

William Stein

http://sage.math.washington.edu

Working On

Getting SAGE-1.5 released.

  1. New PolynomialRing constructor code

    • Get rid of the R.< > = PolynomialRing ... notation (fix lots of doctests)

  2. Make all (most) parent structures unique.
  3. Matrices - implement all the classes using the new carefully *designed* structure.
  4. (for matrices) -- the coverage is bad (write way more doctests).

Mostly David H:

  1. extend what I've been working on to ModuleElement, including _sub_ and _neg_

  2. then do _mul_, with fast pathways for both algebra and ring multiplication
  3. use polynomials as a testbed, i.e. give them proper scalar multiplication semantics
  4. after lots of discussion, a fairly hefty rewrite of the coercion module, both to clarify exactly what's supposed to happen, and also to aim for greater efficiency


Programming

  • Modular forms
  • Optimization of exact linear algebra
  • Modular abelian varieties
  • p-adic Modular Forms
  • p-adic L-functions
  • Quaternion algebra arithmetic

Non-programming

  • Fund raising
  • Documentation
  • Organizing workshops

WilliamStein (last edited 2022-04-11 04:00:21 by mkoeppe)