Closed stumpc5 closed 8 years ago
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.
I also have the problem that the plot only allows irreducible types. When playing with reducible types, I got to the types B vs. G bug in #19830...
Changed branch from u/chapoton/11010 to u/stumpc5/11010
Is this "needs_review" ?
Not quite, I wanted to add a few more doctests for the type B plotting with various indexing sets. But then saw that the indexing in CoxeterGroup
is corrupted, see #19830. This is another issue, but I still want to add more examples/testing.
Branch pushed to git repo; I updated commit sha1. New commits:
0f90c26 | fixed another b/c bug + some cosmetics to the code |
Branch pushed to git repo; I updated commit sha1. New commits:
e8e160c | fixed a docstring and adding one more test |
ok, good enough for me.
I have made two minor doc changes, and now set this again to positive review.
Any further changes will have to be in another ticket.
New commits:
17518c1 | trac #11010 two details |
Changed branch from u/stumpc5/11010 to u/chapoton/11010
Changed branch from u/chapoton/11010 to 17518c1
This patch provides an implementation of the subword complex:
Fix a Coxeter system (W,S). Let Q = be a finite word in S and pi in W.
The subword complex Delta(Q,pi) is then defined to be the simplicial complex with vertices being {0,...,n-1}, (n = len(Q), one vertex for each letter in Q) and with facets given by all (indices of) subwords Q' of Q for which Q\Q' is a reduced expression for pi.
Component: combinatorics
Keywords: subword complex, simplicial complex
Author: Christian Stump
Branch/Commit:
17518c1
Reviewer: Frédéric Chapoton
Issue created by migration from https://trac.sagemath.org/ticket/11010