Search arXivSearch

arXiv · 1507.07047

Impossible intersections in a Weierstrass family of elliptic curves

Abstract

Consider the Weierstrass family of elliptic curves $E_λ:y^2=x^3+λ$ parametrized by nonzero $λ\in\overline{\mathbb{Q}_2}$, and let $P_λ(x)=(x,\sqrt{x^3+λ})\in E_λ$. In this article, given $α,β\in\overline{\mathbb{Q}_2}$ such that $\fracαβ\in\mathbb{Q}$, we provide an explicit description for the set of parameters $λ$ such that $P_λ(α)$ and $P_λ(β)$ are simultaneously torsion for $E_λ$. In particular we prove that the aforementioned set is empty unless $\fracαβ\in\{-2,-\frac{1}{2}\}$. Furthermore, we show that this set is empty even when $\fracαβ\notin\mathbb{Q}$ provided that $α$ and $β$ have distinct $2-$adic absolute values and the ramification index $e(\mathbb{Q}_2(\fracαβ)~\vert~\mathbb{Q}_2)$ is coprime with $6$. We also improve upon a recent result of Stoll concerning the Legendre family of elliptic curves $E_λ:y^2=x(x-1)(x-λ)$, which itself strengthened earlier work of Masser and Zannier by establishing that provided $a,b$ have distinct reduction modulo $2$, the set $\{λ\in\mathbb{C}\setminus\{0,1\}~:~(a,\sqrt{a(a-1)(a-λ)}),(b,\sqrt{b(b-1)(b-λ)})\in (E_λ)_{tors}\}$ is empty.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Niki Myrto Mavraki. 2016-07-18. Impossible intersections in a Weierstrass family of elliptic curves. https://doi.org/10.1016/j.jnt.2016.05.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