Search arXivSearch

arXiv · 2109.00830

Arithmetic statistics and diophantine stability for elliptic curves

Abstract

We study the growth and stability of the Mordell-Weil group and Tate-Shafarevich group of an elliptic curve defined over the rationals, in various cyclic Galois extensions of prime power order. Mazur and Rubin introduced the notion of diophantine stability for the Mordell-Weil group an elliptic curve $E$ at a given prime $p$. Inspired by their definition of stability for the Mordell-Weil group, we introduce an analogous notion of stability for the Tate-Shafarevich group, called "Sha"-stability. Using methods in arithmetic statistics and Iwasawa theory, we study the diophantine stability of elliptic curves on average. First, we prove results for a fixed elliptic curve $E$ and varying prime $p$. It is shown that any non-CM elliptic curve of rank 0 defined over the rationals is diophantine stable and "Sha"-stable at $100\%$ of primes $p$. Next, we show that standard conjectures on rank distribution give lower bounds for the proportion of rational elliptic curves $E$ that are diophantine stable at a fixed prime $p\geq 11$. Related questions are studied for rank jumps and growth of ranks Tate-Shafarevich groups on average in prime power cyclic extensions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anwesh Ray. 2021-09-03. Arithmetic statistics and diophantine stability for elliptic curves. https://doi.org/10.1007/s11139-023-00701-9

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