Search arXivSearch

arXiv · 2001.01016

Minimal models of rational elliptic curves with non-trivial torsion

Abstract

In this paper, we explicitly classify the minimal discriminants of all elliptic curves $E/\mathbb{Q}$ with a non-trivial torsion subgroup. This is done by considering various parameterized families of elliptic curves with the property that they parameterize all elliptic curves $E/\mathbb{Q}$ with a non-trivial torsion point. We follow this by giving admissible change of variables, which give a global minimal model for $E$. We also provide necessary and sufficient conditions on the parameters of these families to determine the primes at which $E$ has additive reduction. In addition, we use these parameterized families to give new proofs of results due to Frey and Flexor-Oesterlé pertaining to the primes at which an elliptic curve over a number field $K$ with a non-trivial $K$-torsion point can have additive reduction.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexander J. Barrios. 2021-10-06. Minimal models of rational elliptic curves with non-trivial torsion. https://doi.org/10.1007/s40993-021-00296-4

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