#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/chapoton/11010 | f4bc87fa3a884cfb45e9c90bd37c4d1f55c8d090
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by stumpc5):
Replying to [comment:56 stumpc5]:
> * Do you know how I can get the list of (simple, positive, almost
positive, all) roots of a root system when I only have the Weyl group
{{{W}}} at hand? It seems that I have to build a root system from the
Cartan type, though it seems more natural to have a method
{{{WeylGroup.root_system}}} or at least {{{WeylGroup.cartan_matrix}}},
wouldn't it?
Ah, {{{WeylGroup.domain}}} does it...
--
Ticket URL: <http://trac.sagemath.org/ticket/11010#comment:59>
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.
