On the Identification of Elliptic Curves That Admit Infinitely Many Twists Satisfying the Birch-Swinnerton-Dyer Conjecture
Barinder S. Banwait, Xiaoyu Huang
TL;DR
This work identifies non-CM elliptic curves with conductor up to $N<500{,}000$ that admit infinitely many quadratic twists satisfying the full Birch–Swinnerton-Dyer conjecture by encoding the $p$-part and $2$-part BSD conditions into explicit algorithms and applying them to the LMFDB. The authors provide a comprehensive dataset of BSD-satisfying twists, extending prior results up to conductor 150 and enabling unconditional data on $| ext{Sha}(E_d)|$ for these families. They also test the Radziwiłł–Soundararajan conjecture for the distribution of $ ext{log}(| ext{Sha}(E_d)|/ ext{sqrt}|d|)$, finding that generic twists align with a Gaussian limit while the BSD-satisfying subfamily exhibits a systematic bias due to arithmetic restrictions. The results highlight how local arithmetic constraints shape statistical distributions in twist families and demonstrate the value of algorithmic BSD verification for producing large, analyzable datasets in arithmetic statistics.
Abstract
Recent work of Burungale-Skinner-Tian-Wan established the first infinite families of quadratic twists of non-CM elliptic curves over $\mathbb{Q}$ for which the strong Birch-Swinnerton-Dyer (BSD) conjecture holds. Building on their results, we encode the required hypotheses into an explicit algorithm and apply it to the database of elliptic curves in the $L$-functions and Modular Forms Database (LMFDB), identifying all elliptic curves $E$ of conductor at most $500{,}000$ that admit infinitely many quadratic twists satisfying the strong BSD conjecture. Our computations provide certain numerical evidence for a conjecture of Radziwiłł and Soundararajan predicting Gaussian behavior in the analytic order of the Shafarevich-Tate group, while also observing a systematic positive bias within the BSD-satisfying subfamily.
