id summary reporter owner description type status priority milestone component resolution keywords cc merged author reviewer upstream work_issues branch commit dependencies stopgaps
11010 Implementation of the SubwordComplex as defined by Knutson and Miller stumpc5 tbd "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.
{{{
sage: W = CoxeterGroup(['A',2],index_set=[1,2])
sage: w = W.from_reduced_word([1,2,1])
sage: C = SubwordComplex([2,1,2,1,2],w); C
Subword complex of type ['A', 2] for Q = [2, 1, 2, 1, 2] and pi = 121
sage: C.facets()
{(1, 2), (3, 4), (0, 4), (2, 3), (0, 1)}
}}}" enhancement closed major sage-7.0 combinatorics fixed subword complex, simplicial complex Christian Stump Frédéric Chapoton N/A 17518c11f06b77c1823a5b0950285085540a41b2 17518c11f06b77c1823a5b0950285085540a41b2