#12940: Combinatorial implementation of the affine symmetric group
-------------------------------------------------+--------------------------
Reporter: sdenton | Owner: tom denton
Type: enhancement | Status: new
Priority: minor | Milestone: sage-5.6
Component: combinatorics | Resolution:
Keywords: affine, combinatorics, days38 | Work issues:
Report Upstream: N/A | Reviewers:
Authors: tom denton | Merged in:
Dependencies: | Stopgaps:
-------------------------------------------------+--------------------------
Comment (by aschilling):
Hi Tom,
I just answered your question on sage-combinat. In short, you need to
remove some old files left over from your /combinat/affine_permutations/
directory by hand since it gets confused about the file and the directory.
Also, to be consistent with permutation.py, core.py, etc, shouldn't your
file be called affine_permutation.py (without the s)?
In the documentation of AffinePermuation you says
{{{
These are combinatorial implmentations of the affine Weyl groups of
non-exceptional type as permutations of the set of all integers.
the basic algorithms are derived from Bjorner and Brenti's
`Combinatorics
of Coxeter Groups.'
}}}
Don't you mean non-twisted rather than non-exceptional. Type G is
exceptional!
Best,
Anne
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12940#comment:14>
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.
