#11010: Implementation of the SubwordComplex as defined by Knutson and Miller
-------------------------------------+-------------------------------------
Reporter: stumpc5 | Owner: tbd
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.10
Component: combinatorics | Resolution:
Keywords: subword complex, | Merged in:
simplicial complex | Reviewers:
Authors: Christian Stump | Work issues:
Report Upstream: N/A | Commit:
Branch: u/stumpc5/11010 | 6b65d7003f98adc0aab9984cfec28de9b6311eab
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by tscrim):
I'm not too surprised `WeylGroup` is slower; it goes through the GAP
interface (in particular, for multiplication) whereas the reflection
implementation (of Coxeter groups) does not. However because of this, it
can't get things like conjugacy classes. There is probably quite a bit we
can improve with (GAP) matrix groups, but that is an issue for another
ticket.
However, it surprises me a little bit that it is broken for Weyl groups
because the reflection implementation was fairly minimal (up to what comes
from the category).
--
Ticket URL: <http://trac.sagemath.org/ticket/11010#comment:55>
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 https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
