#10976: computing order of a certain subgroup of a permutation group is double
dog
slow (compared to Magma)
----------------------------+-----------------------------------------------
Reporter: was | Owner: swenson
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-5.0
Component: group theory | Keywords: sd32
Work_issues: | Upstream: N/A
Reviewer: | Author:
Merged: | Dependencies:
----------------------------+-----------------------------------------------
Comment(by was):
I changed the name of the patch to our standard format. In particular, by
ending in .patch instead of .txt, it now gets nicely syntax highlighted.
Regarding the actual patch, can you:
1. Indent four spaces instead of 2 (this is the Python.org standard,
which we follow).
2. Explain the mathematics behind the algorithm you are using. For
example, if you look at
http://trac.sagemath.org/sage_trac/attachment/ticket/11975/trac_11975-part4.patch
you'll see that I explain the mathematics behind the algorithm that I've
coded. Alternatively, if the algorithm you coded is very standard, you
could give a reference (though I seem to recall you just came up with it
from scratch).
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/10976#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.
