#11187: Implementation of finite reflection groups
-------------------------------------+-------------------------------------
Reporter: stumpc5 | Owner: tbd
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-7.2
Component: combinatorics | Resolution:
Keywords: reflection group, | Merged in:
days49, days 64.5 | Reviewers:
Authors: Christian Stump | Work issues:
Report Upstream: N/A | Commit:
Branch: | e2f919fa6529b2444dbec4cfffde671b8927d1b7
u/vripoll/11187-new | Stopgaps:
Dependencies: #20107 |
-------------------------------------+-------------------------------------
Comment (by hivert):
Replying to [comment:134 tscrim]:
> One of the thoughts I'm bouncing around is doing a full C/C++ version
using arrays, and then using Cython (mainly `PermutationGroupElement`) as
a transfer layer to Sage/GAP. In which case it probably should be split
off as a little specialized spkg.
This is very similar to what I did. The idea is that if you want large
performance, you need to completely control the way you use the memory. So
what I did is to build in parallel a large linked list of arrays and then
thanks to Cython I returns Sage an iterator which is a view on this list
which wrap the element of the linked list into proper Sage Element.
--
Ticket URL: <http://trac.sagemath.org/ticket/11187#comment:135>
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.
