Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Elliptic curves of unbounded rank and Chebyshev's bias (1304.8011v1)

Published 30 Apr 2013 in math.NT

Abstract: We establish a conditional equivalence between quantitative unboundedness of the analytic rank of elliptic curves over $\mathbb Q$ and the existence of highly biased elliptic curve prime number races. We show that conditionally on a Riemann Hypothesis and on a hypothesis on the multiplicity of the zeros of $L(E,s)$, large analytic ranks translate into an extreme Chebyshev bias. Conversely, we show under a certain linear independence hypothesis on zeros of $L(E,s)$ that if highly biased elliptic curve prime number races do exist, then the Riemann Hypothesis holds for infinitely many elliptic curve $L$-functions and there exist elliptic curves of arbitrarily large rank.

Summary

We haven't generated a summary for this paper yet.