Listing 1 - 10 of 50 | << page >> |
Sort by
|
Choose an application
Choose an application
Choose an application
This is a integrated presentation of the theory of exponential diophantine equations. The authors present, in a clear and unified fashion, applications to exponential diophantine equations and linear recurrence sequences of the Gelfond-Baker theory of linear forms in logarithms of algebraic numbers. Topics covered include the Thue equations, the generalised hyperelliptic equation, and the Fermat and Catalan equations. The necessary preliminaries are given in the first three chapters. Each chapter ends with a section giving details of related results.
Choose an application
"In the first part we construct algorithms (over Q) which we apply to solve Sunit, Mordell, cubic Thue, cubic Thue-Mahler and generalized Ramanujan-Nagell equations. As a byproduct we obtain alternative practical approaches for various classical Diophantine problems, including the fundamental problem of finding all elliptic curves over Q with good reduction outside a given finite set of rational primes. The first type of our algorithms uses modular symbols, and the second type combines explicit height bounds with efficient sieves. In particular we construct a refined sieve for S-unit equations which combines Diophantine approximation techniques of de Weger with new geometric ideas. To illustrate the utility of our algorithms we determined the solutions of large classes of equations, containing many examples of interest which are out of reach for the known methods. In addition we used the resulting data to motivate various conjectures and questions, including Baker's explicit abc-conjecture and a new conjecture on S-integral points of any hyperbolic genus one curve over Q. In the second part we establish new results for certain old Diophantine problems (e.g. the difference of squares and cubes) related to Mordell equations, and we prove explicit height bounds for cubic Thue, cubic Thue-Mahler and generalized Ramanujan-Nagell equations. As a byproduct, we obtain here an alternative proof of classical theorems of Baker, Coates and Vinogradov-Sprindzuk. In fact we get refined versions of their theorems, which improve the actual best results in many fundamental cases. We also conduct some effort to work out optimized height bounds for S-unit and Mordell equations which are used in our algorithms of thefirst part. Our results and algorithms all ultimately rely on the method of Faltings (Arakelov, Parsin, Szpiro) combined with the Shimura-Taniyama conjecture, and they all do not use lower bounds for linear forms in (elliptic) logarithms. In the third part we solve the problem of constructing an efficient sieve for the Sintegral points of bounded height on any elliptic curve E over Q with given Mordell- Weil basis of E(Q). Here we combine a geometric interpretation of the known elliptic logarithm reduction (initiated by Zagier) with several conceptually new ideas. The resulting "elliptic logarithm sieve" is crucial for some of our algorithms of the first part. Moreover, it considerably extends the class of elliptic Diophantine equations which can be solved in practice: To demonstrate this we solved many notoriously difficult equations by combining our sieve with known height bounds based on the theory of logarithmic forms"--
Choose an application
Diophantine number theory is an active area that has seen tremendous growth over the past century, and in this theory unit equations play a central role. This comprehensive treatment is the first volume devoted to these equations. The authors gather together all the most important results and look at many different aspects, including effective results on unit equations over number fields, estimates on the number of solutions, analogues for function fields and effective results for unit equations over finitely generated domains. They also present a variety of applications. Introductory chapters provide the necessary background in algebraic number theory and function field theory, as well as an account of the required tools from Diophantine approximation and transcendence theory. This makes the book suitable for young researchers as well as experts who are looking for an up-to-date overview of the field.
Choose an application
Number theory --- 511.5 --- Diophantine equations --- 511.5 Diophantine equations
Choose an application
Algebraic fields. --- Diophantine equations. --- Corps algébriques
Choose an application
Choose an application
This book proposes a novel approach to the study of Diophantine equations: define an appropriate version of the equation’s size, order all polynomial Diophantine equations by size, and then solve the equations in order. Natural questions about the solution set of Diophantine equations are studied in this book using this approach. Is the set empty? Is it finite or infinite? Can all integer solutions be parametrized? By ordering equations by size, the book attempts to answer these questions in a systematic manner. When the size grows, the difficulty of finding solutions increases and the methods required to determine solutions become more advanced. Along the way, the reader will learn dozens of methods for solving Diophantine equations, each of which is illustrated by worked examples and exercises. The book ends with solutions to exercises and a large collection of open problems, often simple to write down yet still unsolved. The original approach pursued in this book makes it widely accessible. Many equations require only high school mathematics and creativity to be solved, so a large part of the book is accessible to high school students, especially those interested in mathematical competitions such as olympiads. The main intended audience is undergraduate students, for whom the book will serve as an unusually rich introduction to the topic of Diophantine equations. Many methods from the book will be useful for graduate students, while Ph.D. students and researchers may use it as a source of fascinating open questions of varying levels of difficulty.
Diophantine equations. --- Number theory. --- Number Theory.
Choose an application
511.5 --- Diophantine equations --- Fermat's theorem. --- 511.5 Diophantine equations
Listing 1 - 10 of 50 | << page >> |
Sort by
|