#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: | abfff5ffdf5e3d7a90bdaa542ecca3ba2691bffe
Report Upstream: N/A | Stopgaps:
Branch: |
u/stumpc5/20445 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by nthiery):
Replying to [comment:17 stumpc5]:
> 1. I would really like to see how to implement our own permutation group
elements with only what we need. I would hope that to again result in some
speedup. One question there: we have w(-\beta) = -w(\beta), so we would
not need to record the complete permutation on all roots, but on the
positive roots would be enough. That would speed several computations such
as creating new elements and testing for equality), but it would have the
drawback that we constantly need to work mod N (N=nr of positive roots),
e.g., we would have such checks and mod's when multiplying two
permutations.
This business sounds of the same nature as what we have for affine
permutations (in window notation). Would there be a way to use the
same implementation behind the scene?
Cheers,
Nicolas
--
Ticket URL: <http://trac.sagemath.org/ticket/20445#comment:23>
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.
