wiki:SageCombinatRoadMap

Version 19 (modified by nthiery, 4 years ago) (diff)

--

Roadmap and status report for Sage-Combinat

This page is an attempt at drawing a road map for  Sage-Cominat, and in particular the migration from  MuPAD-Combinat.

Todo: extend the history, and include links to the relevant trac tickets.

Overview

All Sage-Combinat tickets

Timeline

  • 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.
  • June 2007: design discussions between Nicolas and Mike at the Axiom Workshop 2007
  • January 2008: presentation of MuPAD-Combinat at the AMS meeting in San-Diego; meeting and discussions with the Sage team
  • February 2008: Sage Days 7 (Los Angeles)
    • Technical experimentation with Sage to see how fit it is for our purposes.
    • Partial port of the crystals library (#2742, AnneSchilling? and NicolasThiéry?)
    • Implementation of Xin's Omega algorithm by Jason and Greg.
  • June 19th 2008: Visit of Florent to Davis. Final decision to migrate!
  • June 24th 2008, FPSAC (Valparaiso, Chile):
    • Official announcement of the migration
    • Goal: elementary combinatorics users can start directly with Sage
  • Summer 2008: port of decomposable objects (from MuPAD-combinat) / species (from aldor-combinat) by Mike Hansen, funded by Google
  • September 08: announcement that Sciface is purchased by Mathworks (Matlab).
    • MuPAD does not qualify anymore as a "reasonably priced high quality computer algebra system".
    • Sciface cancels its formerly liberal licence policy for MuPAD-Combinat developers.
    • Plan for a last stable release of MuPAD-Combinat dropped.
  • October 08: Sage Days 10 (Nancy, France)
    • Get the core MuPAD-Combinat developers started with Sage
    • Design, prioritization, planning
    • Design of the categories and (Hopf) algebra framework using the new coercion system
  • July 2009:  FPSAC'09 (RISC, Linz, Austria)
    • Goal: Most features ported
    • Goal: Most of the research done with Sage-Combinat
    • Goal: All new users can start directly with Sage

Progress

Topic Progress Priority Comments
Basic combinatorial classes 75% 2007-08 by Mike
Decomposable objects / Species 75% Google summer of code 2008 by Mike
Trees 0%
Posets %
Words %
Copy-on-write data structure 30%
Symmetric functions 90%
k-Schur & the like 50%
Root systems / ... 75%
Crystals 75%
Category framework 50% Beta patch in sage-combinat
Hopf algebra framework 10%
Free modules & such 20%
Algebra (desosseur, ...) 0%
* with several bases 0%
Operads 0%
Linbox interface 100% (compares to 10% in MuPAD)
GAP interface 100% (compares to 1% in MuPAD)
Interface for fast Gröbner basis 100% (compares to 0% in MuPAD)
Nauty 100% (compares to 50% in MuPAD
Symmetrica 60%
GLIP 50% Deprecated by Robert's generic code (also funded by Google)
dot2tex 10% Delegated to the SAGE graph theorists
Database access 100%
MachineIntegerListsLex? 0% Will be easy via cython
Rigged configurations 0%
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

Attachments

  • P1050207.JPG Download (807.6 KB) - added by nthiery 13 months ago. Roadmap in May 2010 (Sage Days 20.5, Toronto)