#12940: Combinatorial implementation of the affine symmetric group
---------------------------------------------------------+------------------
Reporter: sdenton | Owner: tom
denton
Type: enhancement | Status:
positive_review
Priority: minor | Milestone:
sage-5.11
Component: combinatorics | Resolution:
Keywords: affine, combinatorics, days38, days49 | Work issues:
Report Upstream: N/A | Reviewers:
Chris Berg, Anne Schilling
Authors: tom denton | Merged in:
Dependencies: #14673, #8392 | Stopgaps:
---------------------------------------------------------+------------------
Changes (by aschilling):
* status: needs_review => positive_review
Old description:
> 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. Also included are combinatorial implmenetations of affine
> types B,C,D and G. Extension to types E and F should be possible.
New description:
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. Also included are combinatorial implmenetations of affine
types B,C,D and G. Extension to types E and F should be possible.
Apply:
- [attachment:trac_12940_affine_permutations-td.patch]
--
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12940#comment:27>
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 http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/groups/opt_out.
