Search arXivSearch

arXiv · 2103.09814

Quadratic Fields Admitting Elliptic Curves with Rational $j$-Invariant and Good Reduction Everywhere

Abstract

Clemm and Trebat-Leder (2014) proved that the number of quadratic number fields with absolute discriminant bounded by $x$ over which there exist elliptic curves with good reduction everywhere and rational $j$-invariant is $\gg x\log^{-1/2}(x)$. In this paper, we assume the $abc$-conjecture to show the sharp asymptotic $\sim cx\log^{-1/2}(x)$ for this number, obtaining formulae for $c$ in both the real and imaginary cases. Our method has three ingredients: (1) We make progress towards a conjecture of Granville: Given a fixed elliptic curve $E/\mathbb{Q}$ with short Weierstrass equation $y^2 = f(x)$ for reducible $f \in \mathbb{Z}[x]$, we show that the number of integers $d$, $|d| \leq D$, for which the quadratic twist $dy^2 = f(x)$ has an integral non-$2$-torsion point is at most $D^{2/3+o(1)}$, assuming the $abc$-conjecture. (2) We apply the Selberg--Delange method to obtain a Tauberian theorem which allows us to count integers satisfying certain congruences while also being divisible only by certain primes. (3) We show that for a polynomially sparse subset of the natural numbers, the number of pairs of elements with least common multiple at most $x$ is $O(x^{1-ε})$ for some $ε> 0$. We also exhibit a matching lower bound. If instead of the $abc$-conjecture we assume a particular tail bound, we can prove all the aforementioned results and that the coefficient $c$ above is greater in the real quadratic case than in the imaginary quadratic case, in agreement with an experimentally observed bias.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Benjamin Matschke, Abhijit S. Mudigonda. 2023-02-14. Quadratic Fields Admitting Elliptic Curves with Rational $j$-Invariant and Good Reduction Everywhere. https://doi.org/10.1016/j.jnt.2022.11.003

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