Lower bounds for the normalized height and non-dense subsets of varieties in an abelian variety

Mathematics – Number Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

22 pages

Scientific paper

This work is the third part of a series of papers. In the first two we consider curves and varieties in a power of an elliptic curve. Here we deal with subvarieties of an abelian variety in general. Let V be an irreducible variety of dimension d embedded in an abelian variety A, both defined over the algebraic numbers. We say that V is weak-transverse if V is not contained in any proper algebraic subgroup of A, and transverse if it is not contained in any translate of such a subgroup. Assume a conjectural lower bound for the normalized height of V. For V transverse, we prove that the algebraic points of bounded height of V which lie in the union of all algebraic subgroups of A of codimension at least d+1 translated by the points close to a subgroup G of finite rank are non Zariski-dense in V. If G has rank zero, it is sufficient to assume that V is weak-transverse. The notion of closeness is defined using a height function.

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

Lower bounds for the normalized height and non-dense subsets of varieties in an abelian variety 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 Lower bounds for the normalized height and non-dense subsets of varieties in an abelian variety, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lower bounds for the normalized height and non-dense subsets of varieties in an abelian variety will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-195210

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