Search arXivSearch

arXiv · 2407.11891

Tamagawa number conjecture for CM modular forms and Rankin--Selberg convolutions

Abstract

Let $E/F$ be an elliptic curve defined over a number field $F$ with complex multiplication by the ring of integers of an imaginary quadratic field $K$ such that the torsion points of $E$ generate over $F$ an abelian extension of $K$. In this paper we prove the $p$-part of the Birch--Swinnerton-Dyer formula for $E/F$ in analytic rank $1$ for primes $p>3$ split in $K$. This was previously known for $F=\mathbb{Q}$ by work of Rubin as a consequence of his proof of Mazur's Main Conjecture for rational CM elliptic curves, but the problem for $[F:\mathbb{Q}]>1$ remained wide open. The approach introduced in this paper also yields a proof of similar results for CM abelian varieties $A/K$ and for CM modular forms, as well as an analogue in this setting of Skinner's $p$-converse to the theorem of Gross--Zagier and Kolyvagin.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Francesc Castella. 2025-09-30. Tamagawa number conjecture for CM modular forms and Rankin--Selberg convolutions. https://arxiv.org/abs/2407.11891

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