Search arXivSearch

arXiv · 2409.15056

A Heuristic approach to the Iwasawa theory of elliptic curves

Abstract

Let $E_{/\mathbb{Q}}$ be an elliptic curve and $p$ an odd prime such that $E$ has good ordinary reduction at $p$ and the Galois representation on $E[p]$ is irreducible. Then Greenberg's $μ=0$ conjecture predicts that the Selmer group of $E$ over the cyclotomic $\mathbb{Z}_p$-extension of $\mathbb{Q}$ is cofinitely generated as a $\mathbb{Z}_p$-module. In this article we study this conjecture from a statistical perspective. We extend the heuristics of Poonen and Rains to obtain further evidence for Greenberg's conjecture. The key idea is that the vanishing of the $μ$-invariant can be detected by the intersection $M_1\cap M_2$ of two Iwasawa modules $M_1, M_2$ with additional properties in a given inner product space. The heuristic is based on showing that there is a probability measure on the space of pairs $(M_1, M_2)$ respect to which the event that $M_1\cap M_2$ is finite happens with probability $1$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Katharina Müller, Anwesh Ray. 2026-05-13. A Heuristic approach to the Iwasawa theory of elliptic curves. https://doi.org/10.1016/j.jnt.2026.04.012

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