Tenth Algorithmic Number Theory Symposium ANTS-X University of California, San Diego July 9 – 13, 2012 Tenth Algorithmic Number Theory Symposium (ANTS-X) July 9 – 13, 2012

Finding simultaneous diophantine approximations with prescribed quality

Wieb Bosma and Ionica Smeets

Abstract: We give an algorithm that finds a sequence of approximations with Dirichlet coefficients bounded by a constant only depending on the dimension. The algorithm uses the LLL-algorithm for lattice basis reduction. We present a version of the algorithm that runs in polynomial time of the input.

Files available: paper (PDF)