Search arXivSearch

arXiv · math/0502186

Intersection de courbes et de sous-groupes, et problèmes de minoration de hauteur dans les variétés abéliennes C.M

Abstract

We prove a special case of the following conjecture of Zilber-Pink generalising the Manin-Mumford conjecture : let $X$ be a curve inside an Abelian variety $A$ over $\bar{\Q}$, provided $X$ is not contained in a torsion subvariety, the intersection of $X$ with the union of all subgroup schemes of codimension at least 2 is finite ; we settle the case where $A$ is a power of a simple Abelian variety of C.M. type. This generalises the previous known result, due to Viada and Rémond-Viada (who was able to prove the conjecture for power of an elliptic curve with complex multiplication). The proof is based on the strategy of Rémond (following Bombieri, Masser and Zannier) with two new ingredients, one of them, being at the heart of this article : it is a lower bound for the Néron-Tate height of points on Abelian varieties $A/K$ of C.M. type in the spirit of Lehmer's problem. This lower bound is an analog of the similar result of Amoroso and David \cite{ad2003} on $\G_m^n$ and is a generalisation of the theorem of David and Hindry \cite{davidhindry} on the abelian Lehmer's problem. The proof is an adaptation of \cite{davidhindry} using in our abelian case the new ideas introduced in \cite{ad2003}. Furthermore, as in \cite{ad2003} and adapting in the abelian case their proof, we give another application of our result : a lower bound for the absolute minimum of a subvariety $V$ of $A$. Although lower bounds for this minimum were already known (decreasing multi-exponential function of the degree for Bombieri-Zannier), our methods enable us to prove, up to an $ε$ the optimal result that can be conjectured.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nicolas Ratazzi. 2008-01-14. Intersection de courbes et de sous-groupes, et problèmes de minoration de hauteur dans les variétés abéliennes C.M. https://arxiv.org/abs/math/0502186

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