Systems of rational polynomial equations have polynomial size approximate zeros on the average

  • Authors:

  • D. Castro;L. M. Pardo;J. San Martín

  • Affiliations:

  • Laboratoire GAGE, École Polytechnique, 91128 Palaiseau Cedex, France;Departamento de Matemáticas, Estadística y Computación, Facultad de Ciencias, Universidad de Cantabria, E-39071 Santander, Spain;Departamento de Matemáticas, Estadística y Computación, Facultad de Ciencias, Universidad de Cantabria, E-39071 Santander, Spain

  • Venue:
  • Journal of Complexity
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

A new technique for the geometry of numbers is exhibited. This technique provides sharp estimates on the number of bounded height rational points in subsets of projective space whose "projective cone" is semi-algebraic. This technique improves existing techniques as the one introduced by Davenport in (J. London Math. Soc. 26 (1951) 179). As main outcome, we conclude that systems of rational polynomial equations of bounded bit length have polynomial size approximate zeros on the average. We also conclude that the average number of projective real solutions of systems of rational polynomial equations of bounded bit length equals the square root of the Bézout number of the given system.