#11010: Implementation of the SubwordComplex as defined by Knutson and Miller
-------------------------------------+-------------------------------------
Reporter: stumpc5 | Owner: tbd
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-7.0
Component: combinatorics | Resolution:
Keywords: subword complex, | Merged in:
simplicial complex | Reviewers: Frédéric Chapoton
Authors: Christian Stump | Work issues:
Report Upstream: N/A | Commit:
Branch: u/chapoton/11010 | 1b10c95a312057dee7d920ff4d06ea713ef5338b
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by tscrim):
The first issue is the result of my quick hacking to get something
working. The Coxeter matrices are equal for the Cartan types B and C, and
the Coxeter matrix is the information passed to the `UniqueRepresentation`
cache. There are a number of ways to go moving forward, but I think that
deserves its own separate ticket.
For the second issue, yes, you are correct. The `n-1` and `n` nodes have
the order 4 relation between them, as this agrees with the corresponding
B/C Cartan types (and the Coxeter matrix). You are welcome to relabel the
Coxeter type, which should work, or go to the Coxeter graph and find the
edge label4ed by 4 and use those nodes. Personally, I would use the latter
option since it is independent of the labeling.
--
Ticket URL: <http://trac.sagemath.org/ticket/11010#comment:72>
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.
