Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2110.01151

An Algorithm for Checking Injectivity of Specialization Maps from Elliptic Surfaces

Tyler Raven Billingsley
View original source ↗Read source document ↗Export metadata ↓

Abstract

Let $E/\mathbb Q(t)$ be an elliptic curve and let $t_0 \in \mathbb Q$ be a rational number for which the specialization $E_{t_0}$ is an elliptic curve. Given a subgroup $M$ of $E(\mathbb Q(t))$ with mild conditions and $t_0 \in \mathbb Q$ coming from a relatively large subset $S_M \subset \mathbb Q$, we provide an algorithm that can show that the specialization map $σ_{t_0} : E(\mathbb Q(t)) \to E_{t_0}(\mathbb Q)$ is injective when restricted to $M$. The set $S_M$ is effectively computable in certain cases, and we carry out this computation for some explicit examples where $E$ is given by a Weierstrass equation.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tyler Raven Billingsley. 2021-12-21. An Algorithm for Checking Injectivity of Specialization Maps from Elliptic Surfaces. https://doi.org/10.1016/j.jnt.2021.11.00

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗