Two infinite families of elliptic curves with rank greater than one
Jeffrey Hatley, Jason Stack

TL;DR
This paper demonstrates that two infinite families of elliptic curves have ranks exceeding one, with specific lower bounds, using elementary and advanced methods, advancing understanding of elliptic curve ranks.
Contribution
It introduces two infinite families of elliptic curves with proven lower bounds on their ranks, employing both elementary and more complex techniques.
Findings
Each $E_m$ has rank at least 2.
Each $E_m'$ has rank at least 3.
Stronger results are obtained with advanced methods.
Abstract
We prove, using elementary methods, that each member of the infinite families of elliptic curves given by and have rank at least and 3, respectively, under mild restrictions on . We also prove stronger results for and using more technical machinery.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic Geometry and Number Theory · Cryptography and Residue Arithmetic · Analytic Number Theory Research
