-
-
Notifications
You must be signed in to change notification settings - Fork 706
Description
[See #15608 for a list of open simon_two_descent tickets]
Given an elliptic curve E the method E.simon_two_descent() returns an ordered triple. This consists of a lower bound on the Mordell-Weil rank of E, an integer which is supposed to be the F_2 dimension of the 2-Selmer group of E, and list of points, generating the part of the Mordell-Weil group that has been found.
Sometimes the second entry is larger than the actual 2-Selmer rank as computed by mwrank, and predicted by BSD. The first curve I know of for which this happens is the elliptic curve '438e1' from Cremona's tables.
sage: E=EllipticCurve('438e1')
sage: E.simon_two_descent()
(0, 3, [(13 : -7 : 1)])
sage: E.selmer_rank() #uses mwrank
1
sage: E.sha().an()
1
The explanation for this is that E.simon_two_descent(), unlike Cremona's mwrank, does not do a second descent and therefore only determines an upper bound on the 2-Selmer rank.
Depends on #11005
Depends on #9322
Upstream: Reported upstream. No feedback yet.
CC: @JohnCremona @williamstein @rlmill
Component: elliptic curves
Keywords: simon_two_descent
Author: Peter Bruin
Branch/Commit: 732191d
Reviewer: Chris Wuthrich
Issue created by migration from https://trac.sagemath.org/ticket/10735