Search arXivSearch

arXiv · 0908.3823

Visibility and the Birch and Swinnerton-Dyer conjecture for analytic rank zero

Abstract

Let $E$ be an optimal elliptic curve over $\Q$ of conductor $N$ having analytic rank zero, i.e., such that the $L$-function $L_E(s)$ of $E$ does not vanish at $s=1$. Suppose there is another optimal elliptic curve over $\Q$ of the same conductor $N$ whose Mordell-Weil rank is greater than zero and whose associated newform is congruent to the newform associated to $E$ modulo an integer $r$. The theory of visibility then shows that under certain additional hypotheses, $r$ divides the product of the order of the Shafarevich-Tate group of $E$ and the orders of the arithmetic component groups of $E$. We extract an explicit integer factor from the the Birch and Swinnerton-Dyer conjectural formula for the product mentioned above, and under some hypotheses similar to the ones made in the situation above, we show that $r$ divides this integer factor. This provides theoretical evidence for the second part of the Birch and Swinnerton-Dyer conjecture in the analytic rank zero case.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Amod Agashe. 2009-10-22. Visibility and the Birch and Swinnerton-Dyer conjecture for analytic rank zero. https://arxiv.org/abs/0908.3823

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