Differences between revisions 3 and 4
Revision 3 as of 2006-10-02 19:32:58
Size: 357
Editor: wstein
Comment:
Revision 4 as of 2006-10-30 03:17:56
Size: 1241
Editor: wstein
Comment:
Deletions are marked like this. Additions are marked like this.
Line 2: Line 2:

I'm the SAGE BDFL.
Line 20: Line 18:

------------------------------------------------------------------

== Working On ==

Getting SAGE-1.5 released.

Mostly William S:

 * get rid of mutability for parent structures
 * Make all (most) parent structures unique
 * Get rid of the R.< > = PolynomialRing ... notation (fix lots of doctests)
 * Matrices - implement all the classes using the new carefully *designed* structure.
 * (for matrices) -- the coverage is bad (write way more doctests).

Mostly David H:
 * extend what I've been working on to ModuleElement, including _sub_ and _neg_
 * then do _mul_, with fast pathways for both algebra and ring multiplication
 * use polynomials as a testbed, i.e. give them proper scalar multiplication semantics
 * 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

William Stein

http://sage.math.washington.edu

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


Working On

Getting SAGE-1.5 released.

Mostly William S:

  • get rid of mutability for parent structures
  • Make all (most) parent structures unique
  • Get rid of the R.< > = PolynomialRing ... notation (fix lots of doctests)

  • Matrices - implement all the classes using the new carefully *designed* structure.
  • (for matrices) -- the coverage is bad (write way more doctests).

Mostly David H:

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

  • then do _mul_, with fast pathways for both algebra and ring multiplication
  • use polynomials as a testbed, i.e. give them proper scalar multiplication semantics
  • 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

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