#11010: Implementation of the SubwordComplex as defined by Knutson and Miller
-------------------------------------+-------------------------------------
       Reporter:  stumpc5            |        Owner:  tbd
           Type:  enhancement        |       Status:  needs_work
       Priority:  major              |    Milestone:  sage-6.2
      Component:  combinatorics      |   Resolution:
       Keywords:  subword complex,   |    Merged in:
  simplicial complex                 |    Reviewers:
        Authors:  Christian Stump    |  Work issues:  coverage
Report Upstream:  N/A                |       Commit:
         Branch:  u/chapoton/11010   |  88643156a58720df968a0cb95e38f94668871a1a
   Dependencies:  #12774             |     Stopgaps:
-------------------------------------+-------------------------------------

Comment (by stumpc5):

 Replying to [comment:17 chapoton]:

 Hi,

 > I would be happy to see you come back here. The code is not very easy to
 understand by me alone.

 I spend some time today trying to get Sage working properly again, but I
 failed so far. I guess I need someone helping me to work properly with
 git...

 * I upgraded Sage using
 
http://wiki.sagemath.org/TentativeConventions#Get_the_latest_official_development_version_of_Sage,
 but I got an error ```error: command 'gcc' failed with exit status```, so
 this is my first problem

 I don't know how to resolve that now (and I also don't know if I tried to
 upgrade to the newest development version or the latest stable version).

 > The remaining issues (15 doctests) seem to be related to a strange use
 of roots, where Weyl group elements seem to be supposed to act on the
 indices of roots in the list of roots. And they do not, of course.

 I use the CHEVIE implementation of finite reflection groups which are
 implemented as permutation groups on indices of roots. This speed things
 drastically, but it is not reall mathematically clean. Moreover, I just
 looked at the code, and

 * I also pushed many non-features that are there only for my research (and
 for which I cannot prove what I want to prove)
 * Many features only make sense for finite Coxeter groups, so such checks
 are still to be implemented.

--
Ticket URL: <http://trac.sagemath.org/ticket/11010#comment:18>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica, 
and MATLAB

-- 
You received this message because you are subscribed to the Google Groups 
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.

Reply via email to