#11010: Implementation of the SubwordComplex as defined by Knutson and Miller
-------------------------------+--------------------------------------------
   Reporter:  stumpc5          |       Owner:  tbd                              
  
       Type:  enhancement      |      Status:  needs_work                       
  
   Priority:  major            |   Milestone:                                   
  
  Component:  combinatorics    |    Keywords:  subword complex, simplicial 
complex
     Author:  Christian Stump  |    Upstream:  N/A                              
  
   Reviewer:                   |      Merged:                                   
  
Work_issues:                   |  
-------------------------------+--------------------------------------------
Changes (by newvalueoldvalue):

  * status:  new => needs_work
  * author:  => Christian Stump
  * component:  PLEASE CHANGE => combinatorics
  * keywords:  => subword complex, simplicial complex
  * type:  PLEASE CHANGE => enhancement


Old description:

> 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])
>     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 = [1,
> 2, 1]
>     sage: C.facets()
>     {(1, 2), (3, 4), (0, 4), (2, 3), (0, 1)}
> }}}
>
> depends on Ticket #8359.
>
> I will upload the patch as soon as the patch on Coxeter groups is ready.

New description:

 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])
     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 = [1,
 2, 1]
     sage: C.facets()
     {(1, 2), (3, 4), (0, 4), (2, 3), (0, 1)}
 }}}

 Depends on Tickets #8359 and #11122.

--

-- 
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/11010#comment:1>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to 
[email protected].
For more options, visit this group at 
http://groups.google.com/group/sage-trac?hl=en.

Reply via email to