Changes between Version 60 and Version 61 of SageCombinatRoadMap


Ignore:
Timestamp:
05/06/12 18:12:58 (4 years ago)
Author:
nthiery
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • SageCombinatRoadMap

    v60 v61  
    5454   * #9558: Make `is_symmetric` method for polynomials or where else useful
    5555   * #9194: Expose and extend the thematic tutorial on symmetric functions
    56    * #9755, #12645, #12381, #8259 (closed)
    5756 * #11929 (prototype): Implement quasi-symmetric functions
    5857   JasonBandlow, Valentin Feray, ???
     
    6362 * Implement Schubert polynomials (Viviane Pons, AdrienBoussicault, Nicolas Borie)
    6463 * #6889: Invariant rings of permutation group
    65 
    66 * Representation theory:
     64* Monoids, algebras, and their representation theory:
    6765  * Finite dimensional algebras:
    6866    * Decomposition of the center, construction of central idempotents (as in MuPAD-Combinat)
     
    8078  * Path algebras:
    8179    * #9889 (prototype): A new module implementing Monomial Algebras
    82   * Experiment with KBMAG / PLURAL (see #4539) to quickly implement various
     80  * Experiment with KBMAG / PLURAL (see #4539) to easily implement
    8381    algebras like affine nilCoxeter algebra, affine nilTemperley Lieb
    8482    algebra, affine local plactic algebra).
     
    8886  * Integrate/interface PyCox
    8987  * Root systems:
     88    * #12882 (prototype): Allows a generalized Cartan matrix as input for Dynkin diagrams
     89      Work in progress by Christian Stump
    9090    * Constructing a root/coroot lattice realization from a pair of matrices
    91       Work in progress by Christian Stump
    92     * Allows a generalized Cartan matrix as input for Dynkin diagrams
     91    * #12838 (needs finalization): Root poset should treat type A1 properly
    9392  * Coxeter groups, reflection groups:
    9493    * Computation of reflection degrees from positive roots (easy)
     
    9897    * #12774: (needs review): various enhancements for Coxeter and Weyl groups
    9998    * #11187 (prototype): Implementation of finite reflection groups
     99    * #11109: Stable grothendieck polynomials for affine Weyl group elements in type A
    100100  * Automatic finite Coxeter/(affine)Weyl type recognition, using graph
    101101    isomorphism with predefined cartan types (complex reflection group is harder)
     
    133133    Depends on #8678
    134134  * #8678: module morphisms (tensor products, inverses, ...)
     135  *
    135136
    136137* Categories & coercion:
     
    145146 * #7420 (prototype): Use breath-first-search or Dijkstra in Coercion, as discussed in  (volunteers?)
    146147   NicolasThiery
     148 * #11935: Make parent/element classes independent of base rings
    147149
    148150* Combinatorics
     
    151153 * Basic support for operads (partially depends on #10662)
    152154   FlorentHivert + FredericChapoton
    153 
    154155 * Generating series, analytic combinatorics, ...:
    155156   * #10669: MacMahon partition analysis, aka Omega operator
    156157   * #10519 (needs review): Computation of asymptotics for multivariate rational fractions
    157 
     158 * Posets:
     159   * #12848: Bug in order_ideal_complement_generators: 'down'
     160   * Support for lazy/infinite posets
     161   * #12916: Dedekind-MacNeil completion of finite posets
    158162 * Enumerated sets:
    159163   * #12913: Deprecate CombinatorialClass in favor of the EnumeratedSet's categories
    160164   * #5268: Further cleanup of Enumerated sets
    161    * #11407: Add normalization to clonable lists
     165   * 10194 (needs review): Set factories
     166     Florent Hivert
     167   * #11407 (prototype): Add normalization to clonable lists
     168     Florent Hivert
    162169   * Use ClonableIntArray and friends for all combinatorial object: permutations, partitions, compositions...
    163170   * Fix everything from: http://wiki.sagemath.org/combinat/Weirdness
     
    167174     Nicolas Borie
    168175   * #6538: Reimplement from scratch IntegerListsLex, fixing its 8-year old bugs
    169 
    170176   * Trees:
    171177     * #8703 (needs review): Improve Trees
     
    173179
    174180== Former road maps and history ==
    175 
    176 * Todo for/at Sage Days 20.5 (May 2010):
    177     * Design and implement framework for computing with representations / modules / character rings
    178181
    179182* 2012:
     
    185188  * Coercion: #11250, #11257
    186189  * Enumerated sets: #11118
    187   * Posets: #10998 (Categorification), #12476, #12677, #10670, #11382, #12536 (Linear extensions)
     190  * Posets: #10998 (Categorification), #12476, #12677, #10670, #11382,
     191    #12536 (Linear extensions), #12831 (products)
     192
    188193  * Modules and vector spaces: #12464, #12484, #12489, #12528
    189194  * Root systems:
     
    204209
    205210* 2010:
     211  * Symmetric functions:
     212    * #8259: Conversion from symmetric polynomials to basis of monomial symmetric functions
     213    * #8259, #9755, #12381
    206214  * Root systems, crystals, ...
    207215    * #8984: Implementation of the Lenart--Postnikov alcove path crystal
    208216    * #8380: Interface with GAP3
    209217    * #8911: Categorification of Crystals
     218    * #8810: Stanley symmetric functions
     219    * #8811: Translation for elements of a root lattice and related features and fixes
    210220  * Categories, parents, elements:
    211221    * #8001: Stronger category tests
     
    215225    * #8120: UniqueRepresentation and hash value
    216226    * #8028: Improvements to element_wrapper
    217   * Symmetric functions:
    218     * #8259: Conversion from symmetric polynomials to basis of monomial symmetric functions
     227    * #12645, ...
    219228  * Modules and vector spaces:
    220229    * #8876: Triangular morphisms with domain and codomain having different index sets
     
    223232    * #9651: Addition on CombinatorialFreeModule directly on dictionaries (closed: fixed)
    224233    * #9648: ModulesWithBasis allows module_morphism's to a wider class of ... (closed: fixed)
    225 
    226234  * Graphs:
    227235    * #7004: Refactor the graph layout code, and add interface with graphviz for acyclic layout
     
    230238    * #6655: Cleanups and new features about corners and cells in partition and tableau
    231239    * #6775: Disjoint set data structure
    232 
    233 
    234240  * Words:
    235241    * words bug : #8095 (word morphism is primitive), #8140 (sturmian words definition), #8186 (length handling), #8215 (empty word), #8232 (cmp bug), #7520 (word construction)