Search arXivSearch

arXiv · 2409.01350

Zeta elements for elliptic curves and applications

Abstract

Let $E$ be an elliptic curve defined over $\mathbb{Q}$ with conductor $N$ and $p\nmid 2N$ a prime. Let $L$ be an imaginary quadratic field with $p$ split. We prove the existence of $p$-adic zeta element for $E$ over $L$, encoding two different $p$-adic $L$-functions associated to $E$ over $L$ via explicit reciprocity laws at the primes above $p$. We formulate a main conjecture for $E$ over $L$ in terms of the zeta element, mediating different main conjectures in which the $p$-adic $L$-functions appear, and prove some results toward them. The zeta element has various applications to the arithmetic of elliptic curves. This includes a proof of main conjecture for semistable elliptic curves $E$ over $\mathbb{Q}$ at supersingular primes $p$, as conjectured by Kobayashi in 2002. It leads to the $p$-part of the conjectural Birch and Swinnerton-Dyer (BSD) formula for such curves of analytic rank zero or one, and enables us to present the first infinite families of non-CM elliptic curves for which the BSD conjecture is true. We provide further evidence towards the BSD conjecture: new cases of $p$-converse to the Gross--Zagier and Kolyvagin theorem, and $p$-part of the BSD formula for ordinary primes $p$. Along the way, we give a proof of a conjecture of Perrin-Riou connecting Beilinson--Kato elements with rational points.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ashay Burungale, Christopher Skinner, Ye Tian, Xin Wan. 2024-09-11. Zeta elements for elliptic curves and applications. https://arxiv.org/abs/2409.01350

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