Search arXivSearch

arXiv · 0911.2871

Towards an 'average' version of the Birch and Swinnerton-Dyer Conjecture

Abstract

The Birch and Swinnerton-Dyer conjecture states that the rank of the Mordell-Weil group of an elliptic curve E equals the order of vanishing at the central point of the associated L-function L(s,E). Previous investigations have focused on bounding how far we must go above the central point to be assured of finding a zero, bounding the rank of a fixed curve or on bounding the average rank in a family. Mestre showed the first zero occurs by O(1/loglog(N_E)), where N_E is the conductor of E, though we expect the correct scale to study the zeros near the central point is the significantly smaller 1/log(N_E). We significantly improve on Mestre's result by averaging over a one-parameter family of elliptic curves, obtaining non-trivial upper and lower bounds for the average number of normalized zeros in intervals on the order of 1/log(N_E) (which is the expected scale). Our results may be interpreted as providing further evidence in support of the Birch and Swinnerton-Dyer conjecture, as well as the Katz-Sarnak density conjecture from random matrix theory (as the number of zeros predicted by random matrix theory lies between our upper and lower bounds). These methods may be applied to additional families of L-functions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

John Goes, Steven J Miller. 2009-11-21. Towards an 'average' version of the Birch and Swinnerton-Dyer Conjecture. https://doi.org/10.1016/j.jnt.2010.04.002

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT