#20445: Iteration through finite Coxeter groups
-------------------------+-------------------------------------------------
Reporter: | Owner:
stumpc5 | Status: new
Type: | Milestone: sage-7.2
enhancement | Resolution:
Priority: major | Merged in:
Component: | Reviewers:
combinatorics | Work issues:
Keywords: | Commit:
Authors: | 7eebd4b5cdecf9263eff38253b16d8ca9d777a3c
Report Upstream: N/A | Stopgaps:
Branch: |
u/stumpc5/20445 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by stumpc5):
I locally reimplemented the multiplication of
{{{PermutationGroupElement}}}. This resulted in
{{{
sage: W = ReflectionGroup(['E',7])
sage: from sage.combinat.root_system.reflection_group_c import
parabolic_iteration
sage: timeit("for w in parabolic_iteration(W): pass",number=5)
5 loops, best of 3: 2.4 s per loop
}}}
If we provide a very restricted implementation of permutations ourselves,
we might get down further quite a bit. Remark: the algorithm without the
multiplication and creation of new permutation group elements only takes
{{{.5sec}}}, so there is a lot to improve still.
--
Ticket URL: <http://trac.sagemath.org/ticket/20445#comment:12>
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.
