Differences between revisions 1 and 2
Revision 1 as of 2008-03-16 19:08:56
Size: 1425
Editor: RobertMiller
Comment:
Revision 2 as of 2008-03-16 19:18:54
Size: 1427
Editor: RobertMiller
Comment:
Deletions are marked like this. Additions are marked like this.
Line 6: Line 6:
Michael Abshoff, Martin Albrecht, Burcin Erocal, Willem
     
Jan Palenstijn, Clement Pernet, William Stein: memory
Michael Abshoff, Martin Albrecht, Burcin Erocal, Willem Jan Palenstijn, Clement Pernet, William Stein:

     
memory

Sage 2.10.4 Release Tour

Sage 2.10.4 was released on ?????. For the official, comprehensive release notes, see the HISTORY.txt file that comes with the release. For the latest changes see[http://sagemath.org/announce/sage-2.10.4.txt sage-2.10.4.txt]. Among many other things that were done, we have increased documentation substantially, and fixed many bugs. Of course, this list is incomplete; see the release notes for more details.

Memory leaks exposed by modular symbols

Michael Abshoff, Martin Albrecht, Burcin Erocal, Willem Jan Palenstijn, Clement Pernet, William Stein:

  • memory leaks exposed by modular symbols functionality [this ticket is a composit of numerous other memleak fixes merged over a *7 months* period. Modular forms are an excellent way to expose memory leaks in pretty much every algebraic component of Sage and all know issues there are now finally fixed]

SQLAlchemy and DSage

to be written

Graph theory: chromatic polynomial

An algorithm originally written in C by Gordon Royle has been adapted to replace the old slow method. This algorithm uses a cut and merge algorithm to recursively compute the chromatic polynomial, and is written in Cython.

Documentation

at least

  • 2475
  • 2447
  • 2432
  • 2328

Macdonald polynomials, LLT polynomials, Jack polynomials, etc.

to be written

ReleaseTours/sage-2.10.4 (last edited 2009-12-27 10:04:12 by Minh Nguyen)