Search arXivSearch

arXiv · 2510.00750

Elliptic curves and finitely generated Galois groups

Abstract

Let $K$ be an extension of $\mathbb{Q}$ and $A/K$ an elliptic curve. If $\mathrm{Gal}(\bar K/K)$ is finitely generated, then $A$ is of infinite rank over $K$. In particular, this implies the $g=1$ case of the Junker-Koenigsmann conjecture. This "anti-Mordellic'' result follows from a new "Mordellic'' theorem, which asserts that if $K_0$ is finitely generated over $\mathbb{Q}$, the points of an abelian variety $A_0/K_0$ over the compositum of all bounded-degree Galois extensions of $K_0$ form a virtually free abelian group. This, in turn, follows from a second Mordellic result, which asserts that the group of $A_0$ over the extension of $K_0$ defined by the torsion of $A_0(\bar K_0)$ is free modulo torsion.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bo-Hae Im, Michael Larsen. 2026-07-23. Elliptic curves and finitely generated Galois groups. https://arxiv.org/abs/2510.00750

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