#12940: Combinatorial implementation of the affine symmetric group
-----------------------------+----------------------------------------------
Reporter: sdenton | Owner: tom denton
Type: enhancement | Status: new
Priority: minor | Milestone: sage-5.1
Component: PLEASE CHANGE | Keywords: affine, combinatorics, days38
Work issues: | Report Upstream: N/A
Reviewers: | Authors: tom denton
Merged in: | Dependencies:
Stopgaps: |
-----------------------------+----------------------------------------------
This is a combinatorial implementation of the affine symmetric group,
providing a second implementation of the WeylGroup(['A',k,1]), but quite a
bit faster. The basic idea should be easily extensible to the
combinatorial interpretations of the other affine types with window
notations, and I've discussed a bit with N. Thiery about hacking together
a kind of window notation for the other types.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12940>
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.
