Changes between Version 57 and Version 58 of SageCombinatRoadMap


Ignore:
Timestamp:
05/06/12 09:42:15 (13 months ago)
Author:
nthiery
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • SageCombinatRoadMap

    v57 v58  
    6161   Bruce 
    6262 * Implement Schubert polynomials (Viviane Pons, AdrienBoussicault, Nicolas Borie) 
    63  
     63 * #6889: Invariant rings of permutation group 
    6464 
    6565   * #10305 (prototype): Add rings for the center of the symmetric group algebras 
    6666     Mathieu Guay-Paquet, Valentin Feray 
    6767 
    68 Tensor products of morphism 
    69 Generalized tensor product 
    70  
    71 * Categories 
    72  * #7980 (closed 5.0) Implement generic support for parents with (multiple) realizations 
     68* Root systems 
     69 
     70  * #8906 (needs finalization): Optional package for gap3 
     71  * Constructing a root/coroot lattice realization from a pair of matrices 
     72    Work in progress by Christian Stump 
     73  * Automatic finite Coxeter/(affine)Weyl type recognition, using graph 
     74    isomorphism with predefined cartan types (complex reflection group is harder) 
     75      (Volunteers?) 
     76  * Computation of reflection degrees from positive roots (easy) 
     77  * #8359 (needs finalization): permutation representation of a Coxeter group, using GAP3 
     78  * #8327 (needs review): implement the universal cyclotomic field, using the Zumbroich basis 
     79    Christian Stump 
     80  * Implement general Coxeter groups given by a Coxeter diagram 
     81  * #12912: Interface to Coxeter 3 from Fokko Ducloux (MikeHansen) 
     82 
     83  * Port over the character tables (depends on 1 to be most useful) 
     84  * Representations/character tables of the Hecke algebras 
     85  * #12774: (needs review): various enhancements for Coxeter and Weyl groups 
     86  * Port Specht (AndrewMathas) 
     87  * Implement data structures for character tables / use it systematically in Sage (Volunteers? Nicolas has some design notes about this): 
     88    * of groups in Sage / GAP 
     89    * of semi-simple algebras (in Sage / GAP) 
     90    * of a coset 
     91    * See #7555: fix Cayley tables, add operation tables 
    7392 
    7493 * Further improve root systems, Coxeter groups and the like, 
     
    7796 * Implement more models of Crystals (alcove and littlemann path, ...): #8984, ... 
    7897 
     98* Modules and vector spaces 
     99  * Tensor products of morphism 
     100  * Generalized tensor product 
     101  * #10673: Roadmap for (Combinatorial)FreeModule 
     102  * #11111 (needs finalization): More support for finite dimensional free modules and algebras 
     103 
     104* Categories 
     105 
     106 * #10963: More functorial constructions (NicolasThiéry) 
     107 
     108 
     109* Combinatorics 
     110 
    79111 * #10662: Improve combinatorial species / decomposable classes 
    80112 * Basic support for operads (partially depends on #10662) 
    81  * Improve Trees #8703 
    82  
    83  * #10963: More functorial constructions (NicolasThiéry) 
     113   FlorentHivert + FredericChapoton 
    84114 
    85115 * Generating series, analytic combinatorics, ...: 
    86116   * #10669: MacMahon partition analysis, aka Omega operator 
    87    * Review #10519: Computation of asymptotics for multivariate rational fractions 
    88  * #10673: Roadmap for (Combinatorial)FreeModule 
    89  
    90    #9651: enhancement: Addition on CombinatorialFreeModule directly on dictionaries (closed: fixed) 
    91    #9648: enhancement: New feature: ModulesWithBasis allows module_morphism's to a wider class of ... (closed: fixed) 
    92  
    93  * Cleanup of combinatorics 
    94    * Goal: deprecate the old CombinatorialClass 
    95    * In practice, all classes that currently inherit from {{{CombinatorialClass}}} should instead inherit from Parent and register themselves in one of the categories ({{{*EnumeratedSets}}}, {{{*FiniteEnumeratedSets}}}, or {{{*InfiniteEnumeratedSets}}}). For examples, see e.g. {{{FiniteEnumeratedSets().example()}}}. 
    96    * Expected benefits: 
    97       * Support for TestSuite 
    98       * Support for conversions, coercions, and morphisms, in particular for bijections (as morphisms in the category of Sets with bijection, with properly defined domain and co-domain rather than python functions). 
    99    * Steps: 
    100       1. Let {{{CombinatorialClass}}} inherits from {{{Parent}}} (mostly done #8910) 
    101       1. For each {{{CombinatorialClass}}} C: 
    102         * Have C inherit directly from {{{Parent}}} 
    103         * Ensure that {{{C.__init__}}} sets up the proper category (Finite|Infinite)... 
    104         * Add {{{TestSuite(C).run()}}} to the doctests and make all the tests pass 
    105         * Have a properly setup attribute {{{C.Element}}} and use {{{C.element_class}}} (as defined by the categories) when constructing elements 
    106         * Ensure proper unique representation behavior by having C inherit both from {{{UniqueRepresentation}}} and {{{Parent}}} 
    107       1. Deprecate and remove {{{CombinatorialClass}}} 
    108       1. Turn all the factory functions into factory classes by mean of {{{ClasscallMetaClass}}}; see {{{PerfectMatching}}} and {{{Trees}}} for an advanced example. 
    109    * Reimplement iteration of subsets/set partitions (too slow!): implementation of a Python extension in C + inclusion in Sage (VincentDelecroix, #10534) 
     117   * #10519 (needs review): Computation of asymptotics for multivariate rational fractions 
     118 
     119 * Enumerated sets: 
     120   * #12913: Deprecate CombinatorialClass in favor of the EnumeratedSet's categories 
     121   * #5268: Further cleanup of Enumerated sets 
     122   * #11407: Add normalization to clonable lists 
     123   * #10534 (needs review): Optimizations for the generation of subwords, subsets, and set partitions 
     124     VincentDelecroix 
     125   * #6812: Enumerate integer vectors modulo to the action of a Permutation Group 
     126     Nicolas Borie 
    110127   * #6538: Reimplement from scratch IntegerListsLex, fixing its 8-year old bugs 
    111128 
     129   * Trees: 
     130     * #8703 (needs review): Improve Trees 
     131     * #11529 (needs review): Rooted_trees 
     132 
     133 
    112134== Former road maps and history == 
    113135 
    114  * Todo for/at the joint Sage-Combinat/Chevie workshop (June 2010): 
    115      * #8380: Finalize and merge the interface with GAP3 
    116      * #6588: Categorification of root systems (NicolasThiéry) 
    117        * Make Root and WeightLatticeRealization into categories 
    118        * Declare the various embeddings as coercion/conversions 
    119        * Define and use an overloaded operator for the scalar product (depends on (7) above) 
    120        * See preliminary patch in the Sage-Combinat queue 
    121      * Constructing a root/coroot lattice realization from pair of matrices (Volunteers?) 
    122      * Automatic finite Coxeter/(affine)Weyl type recognition, using graph 
    123        isomorphism with predefined cartan types (complex reflection group is harder) 
    124        (Volunteers?) 
    125      * Computation of reflection degrees (easy; NicolasThiéry or any volunteer) 
    126      * #8359: Finalize permutation representation of a Coxeter group 
    127      * #8347: Positivity testing for cyclotomic fields. 
    128        See also #8327: implement the universal cyclotomic field, using Zumbroich basis 
    129      * Implement general Coxeter groups given by Coxeter diagram (depends on #8347) 
    130      * Port over the character tables (depends on 1 to be most useful) 
    131      * Representations/character tables of the Hecke algebra 
    132      * Interface to Coxeter 3 from Fokko Ducloux (MikeHansen) 
    133      * Port Specht (AndrewMathas) 
    134      * Implement data structures for character tables / use it systematically in Sage (Volunteers? Nicolas has some design notes about this): 
    135        * of groups in Sage / GAP 
    136        * of semi-simple algebras (in Sage / GAP) 
    137        * of a coset 
    138        * See #7555: fix Cayley tables, add operation tables 
    139  
    140  * Todo for/at Sage Days 20.5 (May 2010): 
    141      * Review of #7004: Refactor the graph layout code, and add 
    142        interface with graphviz for acyclic layout (VincentDelecroix) 
    143      * Finalize the basic Cython data-sctructure for combinatorial objects (in progress #8702, FlorenHivert) 
    144      * Finalize the cleanup of combinatorial object: permutations, partitions, compositions...(First step: #6655 FlorentHivert) 
    145      * Trees (mostly done #8703, FlorentHivert) 
    146      * Basic framework for operads (FlorentHivert + FredericChapoton) 
    147      * Plan for cleanup of Posets + category for partially ordered sets (FlorentHivert + FrancoSaliola) 
    148      * #8876: Generalize #7914 (Florent; depends on #7938) 
    149        - Support for a (partial) inverse function on terms 
    150          (when the indices of the domain do not coincide with those of the codomain) 
    151        - Non invertible triangular morphism: 
    152          - phi.preimage(y): returns the preimage x of y or None if it does not exists (or raise an exception?) 
     136* Todo for/at Sage Days 20.5 (May 2010): 
     137    * Finalize the basic Cython data-sctructure for combinatorial objects (in progress #8702, FlorenHivert) 
     138    * Finalize the cleanup of combinatorial object: permutations, partitions, compositions... 
     139    * #8876: Generalize #7914 (Florent) 
     140      - Support for a (partial) inverse function on terms 
     141        (when the indices of the domain do not coincide with those of the codomain) 
     142      - Non invertible triangular morphism: 
     143        - phi.preimage(y): returns the preimage x of y or None if it does not exists (or raise an exception?) 
    153144         - phi.reduce(y): returns (x, r) such that y = phi(x) + r, and r contains no leading term of phi(domain) 
    154            (that would be euclidean division if phi was x -> x * p where p is some polynomial) 
    155            Better name for that method? 
    156      * (6) Use breath-first-search or Dijkstra in Coercion, as discussed in #7420 (volunteers?) 
    157      * (7) Allow for user defined overloaded operators, with signature declarations (#383 is a progress, but not enough) (NicolasThiéry, depends on (6)) 
    158      * (8) Refactor the support for covariant functorial construction (NicolasThiéry, in good progress) 
    159      * (9) Implement the Sub / Quotient / Subquotient functorial constructions (FlorentHivert?, depends on (8)) 
    160      * (10) Implement Sub and Quotient of finite dimensional free modules / algebras / ... (FlorentHivert?, depends on #7938 and #7914 with generalization) 
    161      * #7980: Extract basic support for the "concrete representation of 
    162        an abstract algebra" relation out of the ncsf patch (JasonBandlow) 
    163      * (7), #7980 are building blocks for further progress in qsym/ncsf/polynomials with several basis (#6889) 
    164      * (9) is a building block for the representation theory of monoids 
    165      * (10) is the main building block for the representation theory of finite dimensional algebra 
    166      * Design and implement framework for computing with representations / modules / character rings 
    167      * Finalize interface to Jean-Éric Pin's Semigroupe package (#8360), and 
    168        extend further the semigroup/monoid/group algebra code (#6654, ...) 
    169      * Explore / expose the functionalities of KBMAG for computing with (semi)groups defined by presentations 
    170      * Discussion about implementation of various algebras (affine nilCoxeter algebra, affine nilTemperley Lieb algebra, affine local plactic algebra), see also patch nilTemperley-as.patch in the sage-combinat queue) (AnneSchilling) This could possibly make use of KBMAG. 
    171      * Categorification of the crystal code (AnneSchilling) #8911 
    172      * Words improvements:  
    173          * #8595, #8618, #8574, #8673 and #8674 (misc defect fixes),  
    174          * #8429 (Split word.py file into 4 files),  
    175          * #8604 (Add a class for factor-enumerable words),  
    176          * #8407 and #8670 (new methods for word paths),  
    177          * #8287 (_check makes it slower),  
    178          * #8431 (Rauzy fractal (discrete planes and broken lines) 
    179  
    180  * Todo for Sage Days 20 (February 2010): 
    181      * Merge #7921 and #8001 in Sage 4.2.2: Categories for extension 
    182        types via __getattr___ + tests(Robert, NicolasThiéry) 
    183      * Merge #7938 in Sage 4.2.2: swap_term_and_monomial (JasonBandlow) 
    184      * Rebase, finalize and merge #7004: Refactor the graph layout code, and add interface with graphviz for acyclic layout 
    185        (Robert Beezer) 
    186      * Finalize #7914: Triangular isomorphisms of free modules (JasonBandlow) 
    187      * #7004 will be used intensively to visualize semigroups and others 
    188      * words bug : #8095 (word morphism is primitive), #8140 (sturmian words definition), #8186 (length handling), #8215 (empty word), #8232 (cmp bug), #7520 (word construction) 
    189      * words enhancement : #8187 (equality of words), #8268 (speed up christoffel words), #8287 (_check function), #8289 (word morphism call function), #7619 (pickle for word defined by callable or iterator), #8233 (concatenation), #8266 (documentation) 
    190      * words new functions : #8093, #8127, #8227 
    191      * Disjoint set data structure : #6775 
    192  
    193  * 2010: 
    194  
    195    *#8259: Conversion from symmetric polynomials to basis of monomial symmetric functions 
    196  
    197  * 2009: 
    198    * Implementation of categories in Sage (#5891, #7251, #7443) (NicolasThiéry, ...) 
    199    * Cleanup and refactoring of root systems and Coxeter groups (#4326, #4327, #4608, #7753, #7754), Weyl characters (#5794) and crystals (#4311,#5729,#3663, #5002, #5729, #5879) (AnneSchilling, DanBump, NicolasBorie, StevenPon, NicolasThiéry, ...) 
    200    * Cleanup and refactoring of the combinatorics (#4549, #5200, #5308, #5487, #5534, #5551, #5781, #5600, #6000, #7403, #7395, #7396, #7397) (FlorentHivert, NicolasThiéry, ...) 
    201    * Implementation of FreeModule / Hopf algebra framework (#6136) 
    202    * Refactoring of symmetric functions (#5457, #6137, #7777) (NicolasThiéry, JasonBandlow) 
    203    * Refactoring of the SymmetricGroupAlgebra to use categories and free modules (#6138) 
    204    * Words, ... 
    205    * Families: #5538, #7208, ... (FlorentHivert) 
    206    * TestSuites: #6097, #6809, #6343, #7478 (NicolasThiéry) 
    207    * Technical patches:  #5120, #5405, #5449, #5598, #5783,  #5843, #5920, 
    208      #5967, #5979, #5985, #5986, #5991, #6000, #6097, #7420, #7421, #7776, #7928, #7842 (NicolasThiéry, ...) 
    209    * Partial support for Iwahori Hecke algebras for all types: #7729 (DanielBump, AnneSchilling, NicolasThiéry) 
    210  
    211  * July 2009: [http://wiki.sagemath.org/combinat/FPSAC09 FPSAC'09] (RISC, Linz, Austria) 
    212    * Goal: Most features ported 
    213    * Goal: Most of the research done with Sage-Combinat 
    214    * Goal: All new users can start directly with Sage 
    215  
    216  * October 08: Sage Days 10 (Nancy, France) 
    217    * Get the core MuPAD-Combinat developers started with Sage 
    218    * Design, prioritization, planning 
    219    * Design of the categories and (Hopf) algebra framework using the new coercion system 
    220  
    221  * September 08: announcement that Sciface is purchased by Mathworks (Matlab). 
    222    * MuPAD does not qualify anymore as a "reasonably priced high quality computer algebra system". 
    223    * Sciface cancels its formerly liberal licence policy for MuPAD-Combinat developers. 
    224    * Plan for a last stable release of MuPAD-Combinat dropped. 
    225  
    226  * Summer 2008: port of decomposable objects (from MuPAD-combinat) / species (from aldor-combinat) by Mike Hansen, funded by Google 
    227  
    228  * June 24th 2008, FPSAC (Valparaiso, Chile): 
    229    * Official announcement of the migration 
    230    * Goal: elementary combinatorics users can start directly with Sage 
    231  
    232  * June 19th 2008: Visit of Florent to Davis. Final decision to migrate! 
    233  
    234  * May 2008: Fixed several of the Weirdness issues (#3286, JasonBandlow) 
    235  
    236  * Spring 2008, in particular at MSRI (Berkeley, USA): 
    237    * Long discussions within the community about the opportunity to switch 
    238    * Port of root systems (#2808, #2809, #2864, #2868, #2874, #2964, #3660, #3664, NicolasThiéry, DanBump, JustinWalker, MikeHansen, TomDenton) 
    239    * Further port and extensions to the crystals library (#2868,#3032,#3417,#3418,#3660, AnneSchilling, DanBump, JustinWalker, BrantJones) 
    240    * Basic setup for FreeModule's 
    241    * Posets (FrancoSaliola) 
    242    * Created the '[http://wiki.sagemath.org/combinat/Weirdness Weirdness]' web page 
    243  
    244  * February 2008: Sage Days 7 (Los Angeles) 
    245    * Technical experimentation with Sage to see how fit it is for our purposes. 
    246    * Partial port of the crystals library (#2742, AnneSchilling and NicolasThiéry) 
    247    * Implementation of Xin's Omega algorithm by Jason and Greg #10669 
    248  
    249  * January 2008: presentation of MuPAD-Combinat at the AMS meeting in San-Diego; meeting and discussions with the Sage team 
    250  
    251  * June 2007: design discussions between Nicolas and Mike at the Axiom Workshop 2007 
    252  
    253  * 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. 
    254  
    255  * December 2000: Birth of [http://mupad-combinat.sf.net/ MuPAD-Combinat] 
     145          (that would be euclidean division if phi was x -> x * p where p is some polynomial) 
     146          Better name for that method? 
     147    * (6) Use breath-first-search or Dijkstra in Coercion, as discussed in #7420 (volunteers?) 
     148    * (7) Allow for user defined overloaded operators, with signature declarations (#383 is a progress, but not enough) (NicolasThiéry, depends on (6)) 
     149    * #7980: Extract basic support for the "concrete representation of 
     150      an abstract algebra" relation out of the ncsf patch (JasonBandlow) 
     151    * (7), #7980 are building blocks for further progress in qsym/ncsf/polynomials with several basis (#6889) 
     152    * (9) is a building block for the representation theory of monoids 
     153    * (10) is the main building block for the representation theory of finite dimensional algebra 
     154    * Design and implement framework for computing with representations / modules / character rings 
     155    * Finalize interface to Jean-Éric Pin's Semigroupe package (#8360), and 
     156      extend further the semigroup/monoid/group algebra code (#6654, ...) 
     157    * Explore / expose the functionalities of KBMAG for computing with (semi)groups defined by presentations 
     158    * Discussion about implementation of various algebras (affine nilCoxeter algebra, affine nilTemperley Lieb algebra, affine local plactic algebra), see also patch nilTemperley-as.patch in the sage-combinat queue) (AnneSchilling) This could possibly make use of KBMAG. 
     159    * Categorification of the crystal code (AnneSchilling) #8911 
     160    * Words improvements:  
     161        * #8595, #8618, #8574, #8673 and #8674 (misc defect fixes),  
     162        * #8429 (Split word.py file into 4 files),  
     163        * #8604 (Add a class for factor-enumerable words),  
     164        * #8407 and #8670 (new methods for word paths),  
     165        * #8287 (_check makes it slower),  
     166        * #8431 (Rauzy fractal (discrete planes and broken lines) 
     167 
     168* Todo for Sage Days 20 (February 2010): 
     169    * #7004 will be used intensively to visualize semigroups and others 
     170    * words bug : #8095 (word morphism is primitive), #8140 (sturmian words definition), #8186 (length handling), #8215 (empty word), #8232 (cmp bug), #7520 (word construction) 
     171    * words enhancement : #8187 (equality of words), #8268 (speed up christoffel words), #8287 (_check function), #8289 (word morphism call function), #7619 (pickle for word defined by callable or iterator), #8233 (concatenation), #8266 (documentation) 
     172    * words new functions : #8093, #8127, #8227 
     173    * Disjoint set data structure : #6775 
     174 
     175* 2012: 
     176  * Symmetric functions and generalizations: 
     177    * #10333: Interface for lrcalc 
     178  * Categories: #9469, #8119, #12527 
     179  * Coercion: #11250, #11257 
     180  * Enumerated sets: #11118 
     181  * Posets: #10998 (Categorification), #12476, #12677, #10670, #11382, #12536 (Linear extensions) 
     182  * Modules and vector spaces: #12464, #12484, #12489, #12528 
     183  * Root systems: 
     184    * #10817: Generalized associahedron as a polyhedral complex 
     185    * #6588: Categorification of root systems 
     186  * Quivers: #10349, #10347 
     187  * Sphinx, Documentation: #9128, #12717, #12849, #12490 
     188  * #7980: Implement generic support for parents with (multiple) realizations 
     189 
     190* 2011: 
     191  * #8702: Datastructure for objects with prototype (clone) design pattern. 
     192 
     193* 2010: 
     194  * #6655: Cleanups and new features about corners and cells in partition and tableau 
     195  * Root systems, crystals, ... 
     196    * #8984: Implementation of the Lenart--Postnikov alcove path crystal 
     197    * #8380: Interface with GAP3 
     198  * Categories: 
     199    * #8001: Stronger category tests 
     200    * #7921: Categories for extension types via __getattr___ 
     201  * Symmetric functions: 
     202    * #8259: Conversion from symmetric polynomials to basis of monomial symmetric functions 
     203  * #7004: Refactor the graph layout code, and add interface with graphviz for acyclic layout 
     204  * Modules and vector spaces: 
     205    * #8876: Triangular morphisms with domain and codomain having different index sets 
     206    * #7914: Triangular isomorphisms of free modules 
     207    * #7938: swap_term_and_monomial 
     208    * #9651: Addition on CombinatorialFreeModule directly on dictionaries (closed: fixed) 
     209    * #9648: ModulesWithBasis allows module_morphism's to a wider class of ... (closed: fixed) 
     210 
     211* 2009: 
     212  * Implementation of categories in Sage (#5891, #7251, #7443) (NicolasThiéry, ...) 
     213  * Cleanup and refactoring of root systems and Coxeter groups (#4326, #4327, #4608, #7753, #7754), Weyl characters (#5794) and crystals (#4311,#5729,#3663, #5002, #5729, #5879) (AnneSchilling, DanBump, NicolasBorie, StevenPon, NicolasThiéry, ...) 
     214  * Cleanup and refactoring of the combinatorics (#4549, #5200, #5308, #5487, #5534, #5551, #5781, #5600, #6000, #7403, #7395, #7396, #7397) (FlorentHivert, NicolasThiéry, ...) 
     215  * Implementation of FreeModule / Hopf algebra framework (#6136) 
     216  * Refactoring of symmetric functions (#5457, #6137, #7777) (NicolasThiéry, JasonBandlow) 
     217  * Refactoring of the SymmetricGroupAlgebra to use categories and free modules (#6138) 
     218  * Words, ... 
     219  * Families: #5538, #7208, ... (FlorentHivert) 
     220  * TestSuites: #6097, #6809, #6343, #7478 (NicolasThiéry) 
     221  * Technical patches:  #5120, #5405, #5449, #5598, #5783,  #5843, #5920, 
     222    #5967, #5979, #5985, #5986, #5991, #6000, #6097, #7420, #7421, #7776, #7928, #7842 (NicolasThiéry, ...) 
     223  * Partial support for Iwahori Hecke algebras for all types: #7729 (DanielBump, AnneSchilling, NicolasThiéry) 
     224 
     225* July 2009: [http://wiki.sagemath.org/combinat/FPSAC09 FPSAC'09] (RISC, Linz, Austria) 
     226  * Goal: Most features ported 
     227  * Goal: Most of the research done with Sage-Combinat 
     228  * Goal: All new users can start directly with Sage 
     229 
     230* October 08: Sage Days 10 (Nancy, France) 
     231  * Get the core MuPAD-Combinat developers started with Sage 
     232  * Design, prioritization, planning 
     233  * Design of the categories and (Hopf) algebra framework using the new coercion system 
     234 
     235* September 08: announcement that Sciface is purchased by Mathworks (Matlab). 
     236  * MuPAD does not qualify anymore as a "reasonably priced high quality computer algebra system". 
     237  * Sciface cancels its formerly liberal licence policy for MuPAD-Combinat developers. 
     238  * Plan for a last stable release of MuPAD-Combinat dropped. 
     239 
     240* Summer 2008: port of decomposable objects (from MuPAD-combinat) / species (from aldor-combinat) by Mike Hansen, funded by Google 
     241 
     242* June 24th 2008, FPSAC (Valparaiso, Chile): 
     243  * Official announcement of the migration 
     244  * Goal: elementary combinatorics users can start directly with Sage 
     245 
     246* June 19th 2008: Visit of Florent to Davis. Final decision to migrate! 
     247 
     248* May 2008: Fixed several of the Weirdness issues (#3286, JasonBandlow) 
     249 
     250* Spring 2008, in particular at MSRI (Berkeley, USA): 
     251  * Long discussions within the community about the opportunity to switch 
     252  * Port of root systems (#2808, #2809, #2864, #2868, #2874, #2964, #3660, #3664, NicolasThiéry, DanBump, JustinWalker, MikeHansen, TomDenton) 
     253  * Further port and extensions to the crystals library (#2868,#3032,#3417,#3418,#3660, AnneSchilling, DanBump, JustinWalker, BrantJones) 
     254  * Basic setup for FreeModule's 
     255  * Posets (FrancoSaliola) 
     256  * Created the '[http://wiki.sagemath.org/combinat/Weirdness Weirdness]' web page 
     257 
     258* February 2008: Sage Days 7 (Los Angeles) 
     259  * Technical experimentation with Sage to see how fit it is for our purposes. 
     260  * Partial port of the crystals library (#2742, AnneSchilling and NicolasThiéry) 
     261  * Implementation of Xin's Omega algorithm by Jason and Greg #10669 
     262 
     263* January 2008: presentation of MuPAD-Combinat at the AMS meeting in San-Diego; meeting and discussions with the Sage team 
     264 
     265* June 2007: design discussions between Nicolas and Mike at the Axiom Workshop 2007 
     266 
     267* 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. 
     268 
     269* December 2000: Birth of [http://mupad-combinat.sf.net/ MuPAD-Combinat]