A note on the quality of simultaneous Diophantine approximations obtained by the LLL algorithm
Abstract
In 1982, A. K. Lenstra, H. W. Lenstra, and L. Lov\'asz introduced the first polynomial-time method to factor a nonzero polynomial f ∈ Q[x] into irreducible factors. This algorithm, now commonly referred to as the LLL Algorithm, can also be applied to compute simultaneous Diophantine approximations. We present a significant improvement of a result by Bosma and Smeets on the quality of simultaneous Diophantine approximations achieved by the LLL Algorithm.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.