Finding simultaneous Diophantine approximations with prescribed quality
classification
🧮 math.NT
keywords
algorithmapproximationsbasisboundedcoefficientsconstantdependingdimension
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.