Finding well approximating lattices for a finite set of points

DOI10.1090/mcom/3320zbMath1461.11105arXiv1604.05989OpenAlexW2963693005MaRDI QIDQ4683170

András Hajdu, Robert Tijdeman, Lajos Hajdu

Publication date: 20 September 2018

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.05989

zbMATH Keywords

latticeDiophantine approximationLLL algorithmleast squares algorithm

Mathematics Subject Classification ID

Lattices and convex bodies (number-theoretic aspects) (11H06) Simultaneous homogeneous approximation, linear forms (11J13)

Cites Work

• Unnamed Item
• Unnamed Item
• Diophantine approximation
• Factoring polynomials with rational coefficients
• Finding simultaneous Diophantine approximations with prescribed quality
• Approximate common divisors via lattices
• Fascinating quasicrystals

This page was built for publication: Finding well approximating lattices for a finite set of points