Algorithmic Resolution of Diophantine Equations - A Computational Cookbook

Klappentext A coherent account of the computational methods used to solve diophantine equations. Zusammenfassung A coherent account of the computational methods used to solve diophantine equations. Topics include local methods! sieving! descent arguments! the LLL algorithm! Baker's theory of linear forms in logarithms! and problems associated with curves. Useful exercises and bibliography are included. Suitable for graduate students and research workers. Inhaltsverzeichnis Preface; 1. Introduction; Part I. Basic Solution Techniques: 2. Local methods; 3. Applications of local methods to diophantine equations; 4. Ternary quadratic forms; 5. Computational diophantine approximation; 6. Applications of the LLL-algorithm; Part II. Methods Using Linear Forms in Logarithms: 7. Thue equations; 8. Thue-Mahler equations; 9. S-Unit equations; 10. Triangularly connected decomposable form equations; 11. Discriminant form equations; Part III. Integral and Rational Points on Curves: 12. Rational points on elliptic curves; 13. Integral points on elliptic curves; 14. Curves of genus greater than one; Appendices; References; Index.

Dettagli sul prodotto

• Autori: Nigel P. Smart, Nigel P. (Hewlett-Packard Laboratories Smart
• Con la collaborazione di: J. W. Bruce (Editore), C. M. Series (Editore)
• Editore: Cambridge University Press ELT
• Lingue: Inglese
• Formato: Copertina rigida
• Pubblicazione: 12.11.1998
• EAN: 9780521641562
• ISBN: 978-0-521-64156-2
• Pagine: 260
• Serie: London Mathematical Society St
• Categoria: Scienze naturali, medicina, informatica, tecnica > Matematica > Teoria delle probabilità, stocastica, statistica matematica