#10976: computing order of a certain subgroup of a permutation group is double
dog
slow (compared to Magma)
----------------------------+-----------------------------------------------
Reporter: was | Owner: joyner
Type: enhancement | Status: new
Priority: major | Milestone: sage-4.7
Component: group theory | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------+-----------------------------------------------
{{{
--- sage
def foo(n):
G = SymmetricGroup(n)
H = G.stabilizer(n//2)
return H.order()
time n = foo(200) // approx 399 seconds
--- magma
n foo(n)
G := Sym(n);
H := Stabiliser(G,n div 2);
return Order(H);
end function;
time n := foo(200); // approx 0.40 seconds
}}}
See also trac #10891 which is all about the underlying algorithms and
ideas related to this problem.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/10976>
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.
