Counting Rational Points on Ruled Varieties

http://dx.doi.org/10.4153/CMB-2004-026-8
Canad. Math. Bull. 47(2004), 264-270

  Published:2004-06-01
 Printed: Jun 2004

In this paper, we prove a general result computing the number of rational points of bounded height on a projective variety $V$ which is covered by lines. The main technical result used to achieve this is an upper bound on the number of rational points of bounded height on a line. This upper bound is such that it can be easily controlled as the line varies, and hence is used to sum the counting functions of the lines which cover the original variety $V$.