Changes between Version 62 and Version 63 of SageCombinatRoadMap
- Timestamp:
- 05/06/12 11:41:44 (13 months ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
SageCombinatRoadMap
v62 v63 15 15 || Decomposable objects / Species || 75% || || #10662 || 16 16 || Trees || 30% || || || 17 || Posets || 18 || Words || 17 || Posets ||100% || || || 18 || Words ||100% || || || 19 19 || Symmetric functions || 90% || || || 20 || k-Schur & the like || 50% || || ||20 || k-Schur & the like || 90% || || || 21 21 || Root systems / ... || 90% || || || 22 22 || Crystals || 90% || || || 23 || Category framework || 80% || || ||24 || Hopf algebra framework || 50% || || ||23 || Category framework ||100% || || || 24 || Hopf algebra framework || 80% || || || 25 25 || Free modules & such || 80% || || || 26 || Algebra (desosseur, ...) || 30% || || || 27 || * with several bases || 50% || || || 28 || Operads || 10% || || || 26 || Algebra (desosseur, ...) || 50% || || || 27 || Operads || 15% || || || 29 28 || Linbox interface ||100% || || (compares to 10% in MuPAD) || 30 29 || GAP interface || 80% || || (compares to 1% in MuPAD) || … … 32 31 || Nauty ||100% || || (compares to 50% in MuPAD || 33 32 || Symmetrica || 60% || || || 34 || lrcalc || 60% || || #10333 ||33 || lrcalc || 95% || || #10333 || 35 34 || GLIP || 50% || || #6812 || 36 35 || graphviz / dot2tex || 80% || || #7004, #10518 || 37 || Copy-on-write data structure || 60% || || see #8702 ||38 36 || Database access ||100% || || || 39 37 || MachineIntegerListsLex || 0% || || Will be easy via cython || 40 || Rigged configurations || 0% || || ||41 38 || 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 || 42 39 … … 62 59 * Implement Schubert polynomials (Viviane Pons, AdrienBoussicault, Nicolas Borie) 63 60 * #6889: Invariant rings of permutation group 61 * Implement more generic algorithms: 62 * Antipode defined recursively 63 * Product and coproduct defined by duality 64 * Group like elements from primitive idempotents 64 65 65 66 * Monoids, algebras, and their representation theory: … … 134 135 * #8678 (needs finalization): module morphisms (tensor products, inverses, ...) 135 136 * Tensor products over an algebra, and application to representation theory 137 * #9280: graded modules 138 * Graded morphisms of modules (inverse, adjoint, ...) 136 139 137 140 * Categories & coercion: … … 163 166 * #12913: Deprecate CombinatorialClass in favor of the EnumeratedSet's categories 164 167 * #5268: Further cleanup of Enumerated sets 165 * 10194 (needs review): Set factories 168 * #10193: graded/... enumerated sets 169 * #10194 (needs review): Set factories 166 170 Florent Hivert 167 171 * #11407 (prototype): Add normalization to clonable lists 168 172 Florent Hivert 169 * Use ClonableIntArray and friends for all combinatorial object: permutations, partitions, compositions...173 * Optimization: use ClonableIntArray and friends for all combinatorial object: permutations, partitions, compositions... 170 174 * Fix everything from: http://wiki.sagemath.org/combinat/Weirdness 175 In particular cleanup permutations!!!! 171 176 * #10534 (needs review): Optimizations for the generation of subwords, subsets, and set partitions 172 177 VincentDelecroix … … 178 183 * #11529 (needs review): Rooted_trees 179 184 180 == Former road maps and history == 185 * Tutorials 186 * Merge in Sage as many of our tutorials 187 * Notebook and help (is this a tutorial or a primer?) 188 * Calculus and Linear algebra 189 * Combinatorics (to be taken from «Calcul Mathématique Avec Sage» 190 NicolasThiery and Hugh Thomas 191 192 * Sage-Combinat workflow: 193 * Write down the properties we want our workflow to have, and improve it! 194 195 == History == 181 196 182 197 * 2012: … … 207 222 * Posets: #10065, #11293 208 223 * Combinatorics: #11300, #11301, #11314 224 * Certainly many more! 209 225 210 226 * 2010:
