#4744: [with patch, needs work] congruence number for elliptic curves
---------------------------+------------------------------------------------
Reporter: robertwb | Owner: was
Type: enhancement | Status: new
Priority: major | Milestone: sage-3.2.2
Component: number theory | Resolution:
Keywords: |
---------------------------+------------------------------------------------
Changes (by was):
* summary: [with patch, needs review] congruence number for elliptic
curves => [with patch, needs work] congruence
number for elliptic curves
Comment:
Since the modular degree is insanely fast to compute, maybe you could also
throw in a check that it divides the congruence number? I.e., in the
code, right after computing the congruence number, actually compute the
modular degree and check divisibility.
Also, in the square-free case, since it is *theorem* that the modular
degree equals the congruence modulus, and the modular degree can be
computed a bazillion times faster, maybe just return it instead? I.e.,
don't do the modular symbols computation at all in the non-square-free
case. One could have an optional algorithm= flag that could force doing
the super-slow modular symbols calculation in all cases, but it is silly
to have it as the default.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/4744#comment:6>
Sage <http://sagemath.org/>
Sage - Open Source Mathematical Software: Building the Car Instead of
Reinventing the Wheel
--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---
