Heuristics for the Brauer-Manin obstruction for curves

Details Heuristics for the Brauer-Manin obstruction for curves Heuristics for the Brauer-Manin obstruction for curves

2005-07-16

arxiv.org/abs/math/0507329v1

Mathematics

Number Theory

7 pages

Scientific paper

We conjecture that if C is a curve of genus >1 over a number field k such that C(k) is empty, then a method of Scharaschkin (equivalent to the Brauer-Manin obstruction in the context of curves) supplies a proof that C(k) is empty. As evidence, we prove a corresponding statement in which C(F_v) is replaced by a random subset of the same size in J(F_v) for each residue field F_v at a place v of good reduction for C, and the orders of Jacobians over finite fields are assumed to be smooth (in the sense of having only small prime divisors) as often as random integers of the same size. If our conjecture holds, and if Shafarevich-Tate groups are finite, then there exists an algorithm to decide whether a curve over k has a k-point, and the Brauer-Manin obstruction to the Hasse principle for curves over the number fields is the only one.

Affiliated with

Also associated with

No associations

Rating

Heuristics for the Brauer-Manin obstruction for curves 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 Heuristics for the Brauer-Manin obstruction for curves, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Heuristics for the Brauer-Manin obstruction for curves will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-453594