#20420: Implement dual braid monoids/groups and Hecke algebras for complex
reflection groups
---------------------------------+-----------------------------
Reporter: tscrim | Owner: sage-combinat
Type: enhancement | Status: new
Priority: major | Milestone: sage-7.2
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
---------------------------------+-----------------------------
Comment (by stumpc5):
Here is a first trivial way of getting a (non-reduced) presentation for
the dual braid monoid:
{{{
sage: W = ReflectionGroup(24); W.is_well_generated()
True
sage: NC = W.noncrossing_partition_lattice()
sage: X = W.reflections().inverse_family()
sage: for chain in NC.maximal_chains():^J print [
X[chain[i-1].inverse()*chain[i]] for i in range(1,len(chain)) ]
}}}
For whatever reason, here is the documentation of Hecke algebras in
Chevie:
https://webusers.imj-prg.fr/~jean.michel/gap3/htm/chap082.htm
--
Ticket URL: <http://trac.sagemath.org/ticket/20420#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 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.
