Research Article

Mestre's Finite Field Method for Searching Elliptic Curves with High Ranks

Number: 47 June 30, 2024
EN

Mestre's Finite Field Method for Searching Elliptic Curves with High Ranks

Abstract

The theory of elliptic curves is one of the popular topics of recent times with its unsolved problems and interesting conjectures. In 1922, Mordell proved that the group of $\mathbb{Q}$-rational points on an elliptic curve is finitely generated. However, the rank of this group, signifying the number of independent generators, can be arbitrarily high for certain curves, a fact yet to be definitively proven. This study leverages the computer algebra system Magma to investigate curves with potentially high ranks using a technique developed by Mestre.

Keywords

References

  1. D. Penney, C. Pomerance, A search for elliptic curves with large rank, Mathematics of Computation 28 (127) (1974) 851–853.
  2. D. Penney, C. Pomerance, Three elliptic curves with rank at least seven, Mathematics of Computation 29 (131) (1975) 965–967.
  3. F. Grunewald, R. Zimmert, Uber einige rationale elliptische Kurven mit treiem Rang ≥ 8, Journal für die Reine und Angewandte Mathematik 1977 (296) (1977) 100–107.
  4. A. Brumer, K. Kramer, The rank of elliptic curves, Duke Mathematical Journal 44 (1977) 715– 743.
  5. J.-F. Mestre, Construction d’une courbe elliptique de rang ≥ 12, Comptes Rendus de l’Academie des Sciences Paris 295 (1982) 643–644.
  6. J.-F. Mestre, Courbes elliptiques et formules explicites, Seminaire de Theorie des Nombres de Grenoble 10 (1982) 1–10.
  7. J.-F. Mestre, Courbe elliptiques de rang ≥ 11 sur Q(t), Comptes Rendus de l Academie des Sciences 313 (1991) 139–142.
  8. J.-F. Mestre, Courbe elliptiques de rang ≥ 12 sur Q(t), Comptes Rendus de l Academie des Sciences 313 (1991) 171–174.

Details

Primary Language

English

Subjects

Algebra and Number Theory

Journal Section

Research Article

Publication Date

June 30, 2024

Submission Date

April 10, 2024

Acceptance Date

May 23, 2024

Published in Issue

Year 2024 Number: 47

APA
Dalkılıç, Ş., & Altınışık, E. (2024). Mestre’s Finite Field Method for Searching Elliptic Curves with High Ranks. Journal of New Theory, 47, 20-27. https://doi.org/10.53570/jnt.1467401
AMA
1.Dalkılıç Ş, Altınışık E. Mestre’s Finite Field Method for Searching Elliptic Curves with High Ranks. JNT. 2024;(47):20-27. doi:10.53570/jnt.1467401
Chicago
Dalkılıç, Şeyda, and Ercan Altınışık. 2024. “Mestre’s Finite Field Method for Searching Elliptic Curves With High Ranks”. Journal of New Theory, nos. 47: 20-27. https://doi.org/10.53570/jnt.1467401.
EndNote
Dalkılıç Ş, Altınışık E (June 1, 2024) Mestre’s Finite Field Method for Searching Elliptic Curves with High Ranks. Journal of New Theory 47 20–27.
IEEE
[1]Ş. Dalkılıç and E. Altınışık, “Mestre’s Finite Field Method for Searching Elliptic Curves with High Ranks”, JNT, no. 47, pp. 20–27, June 2024, doi: 10.53570/jnt.1467401.
ISNAD
Dalkılıç, Şeyda - Altınışık, Ercan. “Mestre’s Finite Field Method for Searching Elliptic Curves With High Ranks”. Journal of New Theory. 47 (June 1, 2024): 20-27. https://doi.org/10.53570/jnt.1467401.
JAMA
1.Dalkılıç Ş, Altınışık E. Mestre’s Finite Field Method for Searching Elliptic Curves with High Ranks. JNT. 2024;:20–27.
MLA
Dalkılıç, Şeyda, and Ercan Altınışık. “Mestre’s Finite Field Method for Searching Elliptic Curves With High Ranks”. Journal of New Theory, no. 47, June 2024, pp. 20-27, doi:10.53570/jnt.1467401.
Vancouver
1.Şeyda Dalkılıç, Ercan Altınışık. Mestre’s Finite Field Method for Searching Elliptic Curves with High Ranks. JNT. 2024 Jun. 1;(47):20-7. doi:10.53570/jnt.1467401

 

TR Dizin 26024
 
Electronic Journals Library 13651
 
                                EBSCO 36309                                     DOAJ 33468
Scilit 20865                                                         SOBİAD 30256

 

29324 JNT is licensed under a Creative Commons Attribution-NonCommercial 4.0 International Licence (CC BY-NC)
 

The Journal of New Theory's website content and procedures are publicly accessible under the CC BY-NC license; commercial use requires our permission.