Changes between Version 60 and Version 61 of SageCombinatRoadMap

Timestamp:

05/06/12 11:12:58 (13 months ago)

Author:

nthiery

Comment:

--

SageCombinatRoadMap

@@ -54 +54 @@
    * #9558: Make `is_symmetric` method for polynomials or where else useful
    * #9194: Expose and extend the thematic tutorial on symmetric functions
-   * #9755, #12645, #12381, #8259 (closed)
  * #11929 (prototype): Implement quasi-symmetric functions
    JasonBandlow, Valentin Feray, ???
@@ -63 +62 @@
  * Implement Schubert polynomials (Viviane Pons, AdrienBoussicault, Nicolas Borie)
  * #6889: Invariant rings of permutation group
-
-* Representation theory:
+* Monoids, algebras, and their representation theory:
   * Finite dimensional algebras:
     * Decomposition of the center, construction of central idempotents (as in MuPAD-Combinat)
@@ -80 +78 @@
   * Path algebras:
     * #9889 (prototype): A new module implementing Monomial Algebras
-  * Experiment with KBMAG / PLURAL (see #4539) to quickly implement various
+  * Experiment with KBMAG / PLURAL (see #4539) to easily implement
     algebras like affine nilCoxeter algebra, affine nilTemperley Lieb
     algebra, affine local plactic algebra).
@@ -88 +86 @@
   * Integrate/interface PyCox
   * Root systems:
+    * #12882 (prototype): Allows a generalized Cartan matrix as input for Dynkin diagrams
+      Work in progress by Christian Stump
     * Constructing a root/coroot lattice realization from a pair of matrices
-      Work in progress by Christian Stump
-    * Allows a generalized Cartan matrix as input for Dynkin diagrams
+    * #12838 (needs finalization): Root poset should treat type A1 properly
   * Coxeter groups, reflection groups:
     * Computation of reflection degrees from positive roots (easy)
@@ -98 +97 @@
     * #12774: (needs review): various enhancements for Coxeter and Weyl groups
     * #11187 (prototype): Implementation of finite reflection groups
+    * #11109: Stable grothendieck polynomials for affine Weyl group elements in type A
   * Automatic finite Coxeter/(affine)Weyl type recognition, using graph
     isomorphism with predefined cartan types (complex reflection group is harder)
@@ -133 +133 @@
     Depends on #8678
   * #8678: module morphisms (tensor products, inverses, ...)
+  * 
 
 * Categories & coercion:
@@ -145 +146 @@
  * #7420 (prototype): Use breath-first-search or Dijkstra in Coercion, as discussed in  (volunteers?)
    NicolasThiery
+ * #11935: Make parent/element classes independent of base rings 
 
 * Combinatorics
@@ -151 +153 @@
  * Basic support for operads (partially depends on #10662)
    FlorentHivert + FredericChapoton
-
  * Generating series, analytic combinatorics, ...:
    * #10669: MacMahon partition analysis, aka Omega operator
    * #10519 (needs review): Computation of asymptotics for multivariate rational fractions
-
+ * Posets:
+   * #12848: Bug in order_ideal_complement_generators: 'down'
+   * Support for lazy/infinite posets
+   * #12916: Dedekind-MacNeil completion of finite posets
  * Enumerated sets:
    * #12913: Deprecate CombinatorialClass in favor of the EnumeratedSet's categories
    * #5268: Further cleanup of Enumerated sets
-   * #11407: Add normalization to clonable lists
+   * 10194 (needs review): Set factories
+     Florent Hivert
+   * #11407 (prototype): Add normalization to clonable lists
+     Florent Hivert
    * Use ClonableIntArray and friends for all combinatorial object: permutations, partitions, compositions...
    * Fix everything from: http://wiki.sagemath.org/combinat/Weirdness
@@ -167 +174 @@
      Nicolas Borie
    * #6538: Reimplement from scratch IntegerListsLex, fixing its 8-year old bugs
-
    * Trees:
      * #8703 (needs review): Improve Trees
@@ -173 +179 @@
 
 == Former road maps and history ==
-
-* Todo for/at Sage Days 20.5 (May 2010):
-    * Design and implement framework for computing with representations / modules / character rings
 
 * 2012:
@@ -185 +188 @@
   * Coercion: #11250, #11257
   * Enumerated sets: #11118
-  * Posets: #10998 (Categorification), #12476, #12677, #10670, #11382, #12536 (Linear extensions)
+  * Posets: #10998 (Categorification), #12476, #12677, #10670, #11382,
+    #12536 (Linear extensions), #12831 (products)
+
   * Modules and vector spaces: #12464, #12484, #12489, #12528
   * Root systems:
@@ -204 +209 @@
 
 * 2010:
+  * Symmetric functions:
+    * #8259: Conversion from symmetric polynomials to basis of monomial symmetric functions
+    * #8259, #9755, #12381
   * Root systems, crystals, ...
     * #8984: Implementation of the Lenart--Postnikov alcove path crystal
     * #8380: Interface with GAP3
     * #8911: Categorification of Crystals
+    * #8810: Stanley symmetric functions
+    * #8811: Translation for elements of a root lattice and related features and fixes
   * Categories, parents, elements:
     * #8001: Stronger category tests
@@ -215 +225 @@
     * #8120: UniqueRepresentation and hash value
     * #8028: Improvements to element_wrapper
-  * Symmetric functions:
-    * #8259: Conversion from symmetric polynomials to basis of monomial symmetric functions
+    * #12645, ...
   * Modules and vector spaces:
     * #8876: Triangular morphisms with domain and codomain having different index sets
@@ -223 +232 @@
     * #9651: Addition on CombinatorialFreeModule directly on dictionaries (closed: fixed)
     * #9648: ModulesWithBasis allows module_morphism's to a wider class of ... (closed: fixed)
-
   * Graphs:
     * #7004: Refactor the graph layout code, and add interface with graphviz for acyclic layout
@@ -230 +238 @@
     * #6655: Cleanups and new features about corners and cells in partition and tableau
     * #6775: Disjoint set data structure
-
-
   * Words:
     * words bug : #8095 (word morphism is primitive), #8140 (sturmian words definition), #8186 (length handling), #8215 (empty word), #8232 (cmp bug), #7520 (word construction)