Root numbers and ranks in positive characteristic

Mathematics – Number Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

40 pages; last version; to appear in Adv. Math

Scientific paper

For a global field K and an elliptic curve E_eta over K(T), Silverman's specialization theorem implies that rank(E_eta(K(T))) <= rank(E_t(K)) for all but finitely many t in P^1(K). If this inequality is strict for all but finitely many t, the elliptic curve E_eta is said to have elevated rank. All known examples of elevated rank for K=Q rest on the parity conjecture for elliptic curves over Q, and the examples are all isotrivial. Some additional standard conjectures over Q imply that there does not exist a non-isotrivial elliptic curve over Q(T) with elevated rank. In positive characteristic, an analogue of one of these additional conjectures is false. Inspired by this, for the rational function field K = kappa(u) over any finite field kappa with odd characteristic, we construct an explicit 2-parameter family E_{c,d} of non-isotrivial elliptic curves over K(T) (depending on arbitrary c, d in kappa^*) such that, under the parity conjecture, each E_{c,d} has elevated rank.

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

Root numbers and ranks in positive characteristic 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 Root numbers and ranks in positive characteristic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Root numbers and ranks in positive characteristic will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-208430

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