A373795 -id:A373795 - cp's OEIS frontend

A031507 a(n) = smallest k>0 such that the elliptic curve y^2 = x^3 + k has rank n, or -1 if no such k exists.

1, 2, 15, 113, 2089, 66265, 1358556

Offset: 0

See A031508 for the smallest negative k. - Artur Jasinski, Nov 21 2011
See A060950 for the rank of y^2 = x^3 + n. - Jonathan Sondow, Sep 10 2013
Gebel, Pethö, & Zimmer: "One experimental observation derived from the tables is that the rank r of Mordell's curves grows according to r = O(log |k|/|log log |k||^(2/3))." Hence this fit suggests a(n) >> exp(n (log n)^(1/3)) where >> is the Vinogradov symbol. - Charles R Greathouse IV, Sep 10 2013
The curves for k and -27*k are isogenous (as Noam Elkies points out---see Womack), so they have the same rank. - Jonathan Sondow, Sep 10 2013
Womack (2003) gives further upper bounds: a(7) <= 47550317, a(8) <= 1632201497, a(9) <= 185418133372, a(10) <=  68513487607153. - M. F. Hasler, Jul 01 2024
The three questions for arbitrary k, positive k, and negative k are not very far from each other because the curves for k and -27k are related by a 3-isogeny and therefore have the same rank. It would be most natural to ask for the minimal |k| for k of either sign [see A373795]. - Noam D. Elkies,  Jul 02 2024
a(16) <= 1160221354461565256631205207888 (Elkies, ANTS-XVI, 2024). The same article also establishes the existence of a value of k which has rank >= 17. - N. J. A. Sloane, Jul 05 2024

			a(12) <= 27*A031508(12) <= 27*6533891544658786928 = 176415071705787247056 (from Quer 1987 and Womack). - _Jonathan Sondow_, Sep 10 2013

Noam D. Elkies, Rank of an elliptic curve and 3-rank of a quadratic field via the Burgess bounds, 2024 Algorithmic Number Theory Symposium, ANTS-XVI, MIT, July 2024.

J. E. Cremona, Elliptic Curve Data
Noam D. Elkies and Zev Klagsbrun, New rank records for elliptic curves having rational torsion, ANTS XIV—Proceedings of the Fourteenth Algorithmic Number Theory Symposium, 233-250. Mathematical Sciences Publishers, Berkeley, CA, 2020.
J. Gebel, Integer points on Mordell curves, web.archive.org copy of the "MORDELL+" file on the SIMATH web site shut down in 2017. [Locally cached copy].
J. Gebel, A. Pethö and H. G. Zimmer, On Mordell's equation, Compositio Math. 110 (1998), 335-367. (doi:10.1023/A:1000281602647 not working as of July 2024.)
J. Quer, Corps quadratiques de 3-rang 6 et courbes elliptiques de rang 12, C. R. Acad. Sc. Paris I, 305 (1987), 215-218.
Tom Womack, Explicit Descent on Elliptic Curves, PhD thesis, University of Nottingham, July 2003.
Tom Womack, Minimal-known positive and negative k for Mordell curves of given rank (personal web page, latest available snapshot on web.archive.org from Jan. 2017), last modified Oct. 2002.

Cf. A031508, A373795.

{A031507(n)=for(k=1, oo, ellrank(ellinit([0, k]))[1]==n && return(k))} \\ Use ellanalyticrank() for PARI version < 2.14. - M. F. Hasler, Jul 01 2024

a(n) <= 27*A031508(n) and A031508(n) <= 27*a(n). - Jonathan Sondow, Sep 10 2013

Definition clarified by Jonathan Sondow, Oct 26 2013

Escape clause added to definition by N. J. A. Sloane, Jun 29 2024, because, as John Cremona reminds me, it is not known if k always exists.

A031508 a(n) = smallest k > 0 such that the elliptic curve y^2 = x^3 - k has rank n, or -1 if no such k exists.

Original entry on oeis.org

1, 2, 11, 174, 2351, 28279, 975379

Offset: 0

Noam D. Elkies

See A031507 for the smallest k>0 such that the elliptic curve y^2 = x^3 + k has rank n. - Jonathan Sondow, Sep 06 2013
See A060951 for the rank of y^2 = x^3 - n. - Jonathan Sondow, Sep 10 2013
Gebel, Pethö, & Zimmer: "One experimental observation derived from the tables is that the rank r of Mordell's curves grows according to r = O(log |k|/|log log |k||^(2/3))." Hence this fit suggests a(n) >> exp(n (log n)^(1/3)) where >> is the Vinogradov symbol. - Charles R Greathouse IV, Sep 10 2013
a(7) <= 56877643. a(8) <= 2520963512. a(9) <= 463066403167. a(10) <= 56736325657288. a(11) <= 46111487743732324. a(12) <= 6533891544658786928. See Table 3.3 in [Womack 2003]. - Jose Aranda, Jun 30 2024
The three questions for arbitrary k, positive k, and negative k are not very far from each other because the curves for k and -27k are related by a 3-isogeny and therefore have the same rank. It would be most natural to ask for the minimal |k| for k of either sign [see A373795].  - Noam D. Elkies,  Jul 02 2024
a(16) <= 1160221354461565256631205207888 (Elkies, ANTS-XVI, 2024). The same article also establishes the existence of a value of k which has rank >= 17. - N. J. A. Sloane, Jul 05 2024

			From _M. F. Hasler_, Jul 01 2024: (Start)
Sequence A060951 = (0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 2, 0, 1, 0, 1, 0, 0, 1, ...) gives the analytic rank of the elliptic curve y^2 = x^3 - k for k = 1, 2, 3, ...
We can see that:
  - the smallest k that gives rank 0 is k = 1 = a(0);
  - the smallest k that gives rank 1 is k = 2 = a(1);
  - the smallest k that gives rank 2 is k = 11 = a(2); etc. (End)

Noam D. Elkies, Rank of an elliptic curve and 3-rank of a quadratic field via the Burgess bounds, 2024 Algorithmic Number Theory Symposium, ANTS-XVI, MIT, July 2024.

J. E. Cremona, Elliptic Curve Data
Noam D. Elkies and Zev Klagsbrun, New rank records for elliptic curves having rational torsion, ANTS XIV—Proceedings of the Fourteenth Algorithmic Number Theory Symposium, 233-250. Mathematical Sciences Publishers, Berkeley, CA, 2020.
J. Gebel, Integer points on Mordell curves [Cached copy, after the original web site tnt.math.se.tmu.ac.jp was shut down in 2017]
J. Gebel, A. Pethö, and H. G. Zimmer, On Mordell's equation, Compositio Mathematica 110 (1998), 335-367. MR1602064.
Tom Womack, Explicit Descent on Elliptic Curves, PhD thesis, University of Nottingham, July 2003
Tom Womack, Minimal-known positive and negative k for Mordell curves of given rank (personal web page, latest available snapshot on web.archive.org from Jan. 2017), last modified 10/2002.

Cf. A031507, A373795.

{a(n) = my(k=1); while(ellanalyticrank(ellinit([0, 0, 0, 0, -k]))[1]<>n, k++); k} \\ Seiichi Manyama, Aug 24 2019

{A031508(n)=for(k=1,oo, ellrank(ellinit([0, -k]))[1]==n && return(k))} \\ M. F. Hasler, Jul 01 2024

a(n) = min { k >= 1 | A060951(k) == n }. - M. F. Hasler, Jul 01 2024

Definition clarified by Jonathan Sondow, Oct 26 2013.

Escape clause added to definition by N. J. A. Sloane, Jun 29 2024, because, as John Cremona reminds me, it is not known if k always exists.

cp's OEIS Frontend

A031507 a(n) = smallest k>0 such that the elliptic curve y^2 = x^3 + k has rank n, or -1 if no such k exists.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

PARI

Formula

Extensions

A031508 a(n) = smallest k > 0 such that the elliptic curve y^2 = x^3 - k has rank n, or -1 if no such k exists.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

PARI

PARI

Formula

Extensions