Smart N.P. The Algorithmic Resolution of Diophantine Equations: A Computational Cookbook

Cambridge: Cambridge University Press, 1999. — 259 p.Beginning with a brief introduction to algorithms and diophantine equations, this volume provides a coherent modern account of the methods used to find all the solutions to certain diophantine equations, particularly those developed for use on a computer. The study is divided into three parts, emphasizing approaches with a wide range of applications. The first section considers basic techniques including local methods, sieving, descent arguments and the LLL algorithm. The second section explores problems that can be solved using Baker's theory of linear forms in logarithms. The final section looks at problems associated with curves, focusing on rational and integral points on elliptic curves. Each chapter concludes with a useful set of exercises. A detailed bibliography is included. This book will appeal to graduate students and research workers interested in solving diophantine equations using computational methods.Preface
Introduction
Basic solution techniques
Local methods
Applications of local methods to diophantine equations
Ternary quadratic forms
Computational diophantine approximation
Applications of the LLL–algorithm
Methods using linear forms in logarithms
Thue equations
Thue-Mahler equations
S-unit equations
Triangularly connected decomposable form equations
Discriminant form equations
Integral and rational points on curves
Rational points on elliptic curves
Integral points on elliptic curves
Curves of genus greater than one
APPENDIX A: Linear forms in logarithms
APPENDIX B: Two useful lemmata
References
Index