Theoreme de Dobrowolski-Laurent pour les extensions abeliennes sur une courbe elliptique a multiplication complexe

Mathematics – Number Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

correction of a small LaTeX bug : the two last pages were unvoluntarily in Italics

Scientific paper

Let E/K be an elliptic curve with complex multiplication and let $K^{ab}$ be the Abelian closure of $K$. We prove in this article that there exists a constant $c(E/K)$ such that : for all point $P\in E(\bar{K})-E_{tors}$, we have \[\hat{h}(P)\geq\frac{c(E/K)}{D}(\frac{\log \log 5D}{\log 2D})^{13},\] where $D=[K^{ab}(P):K^{ab}]$. This result extends to the case of elliptic curve s with complex multiplication the previous resultof Amoroso-Zannier \cite{AZ} on the analogous problem on the multiplicative group $\mathbb{G}_m$, and generalizes to the case of extensions of degree D the result of Baker \cite{baker} on the lower bound of the N\'eron-Tate height of the points defined over an Abelian extension of an elliptic curve with complex multiplication. This result also enables us to simplify the proof of a theorem of Viada \cite{viada}.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Theoreme de Dobrowolski-Laurent pour les extensions abeliennes sur une courbe elliptique a multiplication complexe does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Theoreme de Dobrowolski-Laurent pour les extensions abeliennes sur une courbe elliptique a multiplication complexe, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Theoreme de Dobrowolski-Laurent pour les extensions abeliennes sur une courbe elliptique a multiplication complexe will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-85487

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.