Watkins' conjecture for elliptic curves over function fields
Jerson Caro
Abstract
Open-access reader
Jerson Caro
Abstract
Open-access reader
In 2002 Watkins conjectured that given an elliptic curve defined over $\mathbb{Q}$, its Mordell-Weil rank is at most the $2$-adic valuation of its modular degree. We consider the analogous problem over function fields of positive characteristic, and we prove it in several cases. More precisely, every modular semi-stable elliptic curve over $\mathbb{F}_q(T)$ after extending constant scalars, and every quadratic twist of a modular elliptic curve over $\mathbb{F}_q(T)$ by a polynomial with sufficiently many prime factors satisfy the analogue of Watkins' conjecture. Furthermore, for a well-known family of elliptic curves with unbounded rank due to Ulmer, we prove the analogue of Watkins' conjecture.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In 2002 Watkins conjectured that given an elliptic curve defined over $\mathbb{Q}$, its Mordell-Weil rank is at most the $2$-adic valuation of its modular degree. We consider the analogous problem over function fields of positive characteristic, and we prove it in several cases. More precisely, every modular semi-stable elliptic curve over $\mathbb{F}_q(T)$ after extending constant scalars, and every quadratic twist of a modular elliptic curve over $\mathbb{F}_q(T)$ by a polynomial with sufficiently many prime factors satisfy the analogue of Watkins' conjecture. Furthermore, for a well-known family of elliptic curves with unbounded rank due to Ulmer, we prove the analogue of Watkins' conjecture.
Key concepts: Modular elliptic curve, Elliptic curve, Conjecture, Mathematics, Modular curve, Twists of curves, Modular form, Rank (graph theory)