| | 8 | |
| | 9 | == Timeline == |
| | 10 | * February 2007: First contact with Mike Hansen who wanted to port some features of MuPAD-Combinat, which we very much encouraged. Since then Mike translated 30k lines of code, which accounts for most of the basic combinatorics (tableaux, permutations, ...), and symmetric functions. |
| | 11 | |
| | 12 | * June 2007: design discussions between Nicolas and Mike at the Axiom Workshop 2007 |
| | 13 | |
| | 14 | * January 2008: presentation of MuPAD-Combinat at the AMS meeting in San-Diego; meeting and discussions with the Sage team |
| | 15 | |
| | 16 | * February 2008: Sage Days 7 (Los Angeles) |
| | 17 | * Technical experimentation with Sage to see how fit it is for our purposes. |
| | 18 | * Partial port of the crystals library by Anne and Nicolas; implementation of Xin's Omega algorithm by Jason and Greg. |
| | 19 | |
| | 20 | * Spring 2008, in particular at MSRI (Berkeley, USA): |
| | 21 | * Long discussions within the community about the opportunity to switch |
| | 22 | * Port of root systems (Nicolas, Bump, Justin, Mike, Nicolas, Tom) |
| | 23 | * Further port and extensions to the crystals library (Schilling, Bump, Justin, Brant) |
| | 24 | * Basic setup for FreeModule's |
| | 25 | |
| | 26 | * June 19th 2008: Visit of Florent to Davis. Final decision to switch! |
| | 27 | |
| | 28 | * June 24th 2008, FPSAC (Valparaiso, Chile): |
| | 29 | * official announcement of the switch |
| | 30 | * Goal: being able to launch most new basic users directly with SAGE |
| | 31 | |
| | 32 | * Summer 2008: port of decomposable objects (from MuPAD-combinat) / species (from aldor-combinat) by Mike Hansen, funded by Google |
| | 33 | |
| | 34 | * September 08: announcement that Sciface is purchased by Mathworks. What's the future of MuPAD? |
| | 35 | * Dropped the plan for a last stable release of MuPAD-Combinat |
| | 36 | |
| | 37 | * October 08: Sage Days 10 (Nancy, France) |
| | 38 | * Get most of the MuPAD-Combinat developers started with Sage |
| | 39 | * Design, prioritization, planning |
| | 40 | * Setup of the (Hopf) algebra framework using the new coercion system |
| | 41 | * Refactoring of symmetric functions |
| | 42 | |
| | 43 | * Fall 08, Winter 09 |
| | 44 | * Most new basic users can start directly with Sage |
| | 45 | * Implementation of QSym(), NCSF (Lenni) |
| | 46 | |
| | 47 | * July 2009: FPSAC (RISC, Linz, Austria) |
| | 48 | * Most features ported |
| | 49 | * Most of the research done with Sage-Combinat |
| | 50 | * All new users can start directly with Sage |
| | 51 | |
| | 52 | == Progress == |
| | 53 | |
| | 54 | || Topic ||Progress|| Priority || Comments || |
| | 55 | || Basic combinatorial classes || 75%|| || 2007-08 by Mike || |
| | 56 | || Decomposable objects / Species || 75%|| || Google summer of code 2008 by Mike || |
| | 57 | || Trees || 0%|| || || |
| | 58 | || Posets || %|| || || |
| | 59 | || Words || %|| || |
| | 60 | || Copy-on-write data structure || 30%|| || || |
| | 61 | || Symmetric functions || 90%|| || || |
| | 62 | || k-Schur & the like || 50%|| || || |
| | 63 | || Root systems / ... || 75%|| || || |
| | 64 | || Crystals || 75%|| || || |
| | 65 | || Category framework || 50%|| || Beta patch in sage-combinat || |
| | 66 | || Hopf algebra framework || 10%|| || || |
| | 67 | || Free modules & such || 20%|| || || |
| | 68 | || Algebra (desosseur, ...) || 0%|| || || |
| | 69 | || * with several bases || 0%|| || || |
| | 70 | || Operads || 0%|| || || |
| | 71 | || Linbox interface ||100%|| || (compares to 10% in MuPAD) || |
| | 72 | || GAP interface ||100%|| || (compares to 1% in MuPAD) || |
| | 73 | || Interface for fast Gröbner basis ||100%|| || (compares to 0% in MuPAD) || |
| | 74 | || Nauty ||100%|| || (compares to 50% in MuPAD || |
| | 75 | || Symmetrica || 60%|| || || |
| | 76 | || GLIP || 50%|| || Deprecated by Robert's generic code (also funded by Google)|| |
| | 77 | || dot2tex || 10%|| || Delegated to the SAGE graph theorists|| |
| | 78 | || Database access ||100%|| || || |
| | 79 | || MachineIntegerListsLex || 0%|| || Will be easy via cython || |
| | 80 | || Rigged configurations || 0%|| || || |
| | 81 | || Basic abstract data structures ||100%|| || (fast stacks, AVL, dancing links) compares to just the basic ones in MuPAD + no real way to implement some with serious speed ourselves || |
