#12940: Combinatorial implementation of the affine symmetric group
-------------------------------------------------+--------------------------
Reporter: sdenton | Owner: tom denton
Type: enhancement | Status: new
Priority: minor | Milestone: sage-5.4
Component: combinatorics | Resolution:
Keywords: affine, combinatorics, days38 | Work issues:
Report Upstream: N/A | Reviewers:
Authors: tom denton | Merged in:
Dependencies: | Stopgaps:
-------------------------------------------------+--------------------------
Comment (by nthiery):
Hi Tom!
For the directory structure, you may want to follow that of permutation
groups. Something like:
{{{
sage/groups/affine_permutation_groups/affine_permutation.py
affine_symmetric_group.py
affine_permutation_group.py
}}}
Which just made me think: is there a way to generalize the algorithmic
for permutation groups (see
http://en.wikipedia.org/wiki/Strong_generating_set) to subgroups of
the affine symmetric group? Hmm, if this hasn't been done yet, that
could be a fun research project. Of course, the obvious first
candidates to play with would be the affine coxeter groups realized as
groups of permutations as we had discussed in Montreal.
Cheers,
Nicolas
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12940#comment:11>
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.
