#20477: reduced words in complex reflection group
-------------------------------------------------+-------------------------
       Reporter:  stumpc5                        |        Owner:
           Type:  enhancement                    |       Status:  new
       Priority:  major                          |    Milestone:  sage-7.2
      Component:  combinatorics                  |   Resolution:
       Keywords:  complex reflection groups,     |    Merged in:
  reduced words                                  |    Reviewers:
        Authors:                                 |  Work issues:
Report Upstream:  N/A                            |       Commit:
         Branch:                                 |     Stopgaps:
   Dependencies:                                 |
-------------------------------------------------+-------------------------

Comment (by nthiery):

 Just wondering: is that still the case for a complex reflection group W
 that, if you take a parabolic subgroup W_I and its coset representatives
 W^I the factorization of an element w=w_I w^I is reduced?
 (that is len(w)=len(w_I)+len(w^I))?

 If yes, would there be a way to compute this decomposition? Then one could
 use induction to compute the reduced word for w_I and only do the depth
 first search on W^I?

 I would assume that, if one chooses carefully the base for the permutation
 group (e.g. by starting with the simple roots s_i for i not in I, and then
 the others), then W_I would be one of the groups in the stabilizer chain.
 So expressing w in terms of the strong generators would give the
 decomposition.

 It's probably best to take I a maximal parabolic subgroup. Then, W_I
 should be the first subgroup in the stabilizer chain, and the strong
 generators for this last inclusion W_I \subset W should be exactly the
 coset representatives. And the Shreier tree computed by GAP might actually
 just be the depth first search tree on then (I don't know if GAP uses a
 depth first search though).

 All of this to be taken with a grain of salt ...

--
Ticket URL: <http://trac.sagemath.org/ticket/20477#comment:3>
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.

Reply via email to