BILU, Yuri; HANROT, Guillaume

doi:10.1023/A:1000305028888

Metadatos

Mostrar el registro completo del ítem

Licencia de uso del documento

BILU, Yuri

HANROT, Guillaume
Polynomials, Combinatorics, Arithmetic [POLKA]

Idioma

Article de revue

Este ítem está publicado en

Compositio Mathematica. 1998, vol. 112, n° 3, p. 273--312

Foundation Compositio Mathematica

Resumen en inglés

We describe a method for complete solution of the superelliptic Diophantine equation ay^p=f(x). The method is based on Baker's theory of linear forms in the logarithms. The characteristic feature of our approach (as compared with the classical method is that we reduce the equation directly to the linear forms in logarithms, without intermediate use of Thue and linear unit equations. We show that the reduction method of Baker and Davenport is applicable for superelliptic equations, and develop a very efficient method for enumerating the solutions below the reduced bound. The method requires computing the algebraic data in number fields of degree pn(n-1)/2 at most; in many cases this number can be reduced. Two examples with p=3 and n=4 are given.< Leer menos

Palabras clave

soution of diophantine equations

méthode de Baker

Baker's method

résolution d'équations diophantiennes

Metadatos

Licencia de uso del documento

Solving superelliptic diophantine equations by Baker's method

Idioma

Este ítem está publicado en

Resumen en inglés

Palabras clave

DOI

Orígen

Centros de investigación