Search arXivSearch

arXiv · 2209.02889

Density of Elliptic Curves over Number Fields with Prescribed Torsion Subgroups

Abstract

Let $K$ be a number field. For positive integers $m$ and $n$ such that $m\mid n$, we let $\mathscr{S}_{m,n}$ be the set of elliptic curves $E/K$ defined over $K$ such that $E(K)_{\operatorname{tors}}\supseteq \mathscr{T}\cong \mathbb{Z}/m\mathbb{Z}\times \mathbb{Z}/n\mathbb{Z}$. We prove that if the genus of the modular curve $X_{1}(m,n)$ is $0$, then `almost all' $E\in \mathscr{S}_{m,n}$ satisfy that $E(K)_{\operatorname{tors}}= \mathscr{T}$, i.e., not larger than $\mathscr{T}$. In particular, if $m=n=1$, this result generalizes Duke's theorem over $\mathbb{Q}$ to arbitrary number fields $K$ for the trivial torsion subgroup.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bo-Hae Im, Hansol Kim. 2025-04-02. Density of Elliptic Curves over Number Fields with Prescribed Torsion Subgroups. https://arxiv.org/abs/2209.02889

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