Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1806.06587

Points of Small Heights in Certain Nonabelian Extensions

Soumyadip Sahu
View original source ↗Read source document ↗Export metadata ↓

Abstract

Let $E$ be an elliptic curve without complex multiplication defined over a number field $K$ which has at least one real embedding. The field $F$ generated by all torsion points of $E$ over $K$ is an infinite, non-abelian Galois extension of the ground field which has unbounded, wild ramification above all primes. Following the treatment in 'Small Height And Infinite Nonabelian Extensions' by P. Habegger we prove that the absolute logarithmic Weil height of an element of $F$ is either zero or bounded from below by a positive constant depending only on $E$ and $K$. We also show that the Néron-Tate height has a similar gap on $E(F)$. In appendix-A we have included some new results about Galois properties of division points of formal groups which are generalizations of results proved in chapter 2. This work is my M.Sc. thesis submitted to Chennai Mathematical Institute.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Soumyadip Sahu. 2020-03-27. Points of Small Heights in Certain Nonabelian Extensions. https://arxiv.org/abs/1806.06587

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↗