2000 character limit reached
Conditionally bounding analytic ranks of elliptic curves (1112.1503v1)
Published 7 Dec 2011 in math.NT
Abstract: We describe a method for bounding the rank of an elliptic curve under the assumptions of the Birch and Swinnerton-Dyer conjecture and the generalized Riemann hypothesis. As an example, we compute, under these conjectures, exact upper bounds for curves which are known to have rank at least as large as 20, 21, 22, 23, and 24. For the known curve of rank at least 28, we get a bound of 30.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.