LLL: a tool for effective diophantine approximation

Guillaume Hanrot 1
1 CACAO - Curves, Algebra, Computer Arithmetic, and so On
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : The purpose of this paper is to survey in a unified setting some of the results in diophantine approximation that the LLL algorithm can make effective in an efficient way. We mostly study the problems of finding good rational approximations to vectors of real and p-adic numbers, and of finding approximate linear relations between vectors of real numbers. We also discuss classical applications of those eective versions, among which Mertens' conjecture and the effective solution of diophantine equations.
Type de document :
Communication dans un congrès
Conference in honour of the 25th birthday of the LLL algorithm - LLL+25, Jun 2007, Caen, France. 2007
Liste complète des métadonnées

https://hal.inria.fr/inria-00187880
Contributeur : Guillaume Hanrot <>
Soumis le : jeudi 15 novembre 2007 - 14:15:19
Dernière modification le : jeudi 11 janvier 2018 - 06:21:04

Identifiants

  • HAL Id : inria-00187880, version 1

Collections

Citation

Guillaume Hanrot. LLL: a tool for effective diophantine approximation. Conference in honour of the 25th birthday of the LLL algorithm - LLL+25, Jun 2007, Caen, France. 2007. 〈inria-00187880〉

Partager

Métriques

Consultations de la notice

231