New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Rigorously computing analytic ranks of elliptic curves (for ranks < 4) #19145
Comments
This comment has been minimized.
This comment has been minimized.
Changed branch from u/mkovesi/rigorously_computing_analytic_ranks_of_elliptic_curves__for_ranks_1__2__3_ to none |
Branch: u/mkovesi/19145 |
New commits:
|
Commit: |
This comment has been minimized.
This comment has been minimized.
comment:8
Does this ticket needs review ? I am not volunteering, just point that nobody will look at it unless its status is set to |
comment:10
I am merging with develop (9.3.beta3) -- there were some merge conflicts, but easily fixed. Then I'll upload the new merged branch and set to needs review. I noticed that the old 'pari' code for analytic rank manages to call ellanalyticrank twice which should be fixed whether or not we keep this. But I hope it will be judged as correct, since I use the analytic rank function a lot. I suspect that that the author has disappeared as this is the work of a 5-year old MSc thesis. |
Changed branch from u/mkovesi/19145 to u/cremona/19145 |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:13
some python2 print are lurking ==> needs work |
comment:14
A few comments: The while loops in the last few functions can be simplified. Why is k>15000 an indication that something is wrong? Doesn't k increase as sqrt{N} and so we expect it that large when the conductor is in the millions. I guess we are certain that precision loss in the sum is never larger than epsilon, are we? The sums can be made a bit faster by using Horner's scheme; especially in _G2 etc. Though I would guess that these sums are already implemented in pari. Probably much faster. |
comment:15
Maybe a stupid question because I don't know anything about the context, sorry, but just in case: Your code is using floating-point arithmetic in several places. Is it clear that the computation is rigorous in spite of possible rounding errors? (If not, you may want to consider working in RBF instead of RR.) |
comment:16
Setting a new milestone for this ticket based on a cursory review. |
This is an improvement to the analytic_rank() function in the Elliptic curves over the rational numbers class. The current implementation only produces a value that is probably the analytic rank. This ticket is based on error bound computations to give a provable value of analytic rank. The computations were derived in my MSc thesis, "Proving the weak BSD conjecture for elliptic curves in the Cremona Database".
CC: @pjbruin @JohnCremona
Component: elliptic curves
Keywords: elliptic curves analytic rank sd69
Author: Michelle Kovesi
Branch/Commit: u/cremona/19145 @
ef01fdb
Issue created by migration from https://trac.sagemath.org/ticket/19145
The text was updated successfully, but these errors were encountered: