#9758: implement Watkins-Delaunay's algorithm for computing modular degrees in
Sage
-----------------------------+----------------------------------------------
Reporter: was | Owner: was
Type: enhancement | Status: new
Priority: major | Milestone: sage-4.5.3
Component: number theory | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
-----------------------------+----------------------------------------------
Comment(by was):
Kirkby said:
> It would be good to state on the ticket what level of student project
> this is (undergrad, postgrad), and the skill set needed (C, Python
> etc). I expect you would prefer it in Python, though I think
> personally a C implementation like Mark's, which you can easily call
> from Python, would be more beneficial to the scientific community in
> general - not everyone is using Sage/Python.
Good idea.
Level: graduate student or greater, with a background in number theory.
Skill set needed: read C, write Python, possibly Cython later for speed
purposes.
C versus Python: the implementation can depend on absolutely anything in
Sage; for this I'm not concerned about providing a general tool for the
scientific community.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/9758#comment:1>
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.
