Work examines the latest algorithms and tools to solve classical types of diophantine equations.; Unique book---closest competitor, Smart, Cambridge, does not treat index form equations.; Author is a leading researcher in the field of computational algebraic number theory.; The text is illustrated with several tables of various number fields, including their data on power integral bases.; Several interesting properties of number fields are examined.; Some infinite parametric families of fields are also considered as well as the resolution of the corresponding infinite parametric families of diophantine equations.

This book includes different topics associated with integral and integro-differential equations and their relevance and significance in various scientific areas of study and research. Integral and integro-differential equations are capable of modelling many situations from science and engineering. Readers should find several useful and advanced methods for solving various types of integral and integro-differential equations in this book. The book is useful for graduate students, Ph.D. students, researchers and educators interested in mathematical modelling, applied mathematics, applied sciences, engineering, etc. Key Features • New and advanced methods for solving integral and integro-differential equations • Contains comparison of various methods for accuracy • Demonstrates the applicability of integral and integro-differential equations in other scientific areas • Examines qualitative as well as quantitative properties of solutions of various types of integral and integro-differential equations

Excellent intro to basics of algebraic number theory. Gausian primes; polynomials over a field; algebraic number fields; algebraic integers and integral bases; uses of arithmetic in algebraic number fields; more. 1975 edition.

The goal of the book is to summarize those methods for evaluating Feynman integrals that have been developed over a span of more than fifty years. The book characterizes the most powerful methods and illustrates them with numerous examples starting from very simple ones and progressing to nontrivial examples. The book demonstrates how to choose adequate methods and combine evaluation methods in a non-trivial way. The most powerful methods are characterized and then illustrated through numerous examples. This is an updated textbook version of the previous book (Evaluating Feynman integrals, STMP 211) of the author.

Work examines the latest algorithms and tools to solve classical types of diophantine equations.; Unique book---closest competitor, Smart, Cambridge, does not treat index form equations.; Author is a leading researcher in the field of computational algebraic number theory.; The text is illustrated with several tables of various number fields, including their data on power integral bases.; Several interesting properties of number fields are examined.; Some infinite parametric families of fields are also considered as well as the resolution of the corresponding infinite parametric families of diophantine equations.

Number Fields is a textbook for algebraic number theory. It grew out of lecture notes of master courses taught by the author at Radboud University, the Netherlands, over a period of more than four decades. It is self-contained in the sense that it uses only mathematics of a bachelor level, including some Galois theory. Part I of the book contains topics in basic algebraic number theory as they may be presented in a beginning master course on algebraic number theory. It includes the classification of abelian number fields by groups of Dirichlet characters. Class field theory is treated in Part II: the more advanced theory of abelian extensions of number fields in general. Full proofs of its main theorems are given using a ‘classical’ approach to class field theory, which is in a sense a natural continuation of the basic theory as presented in Part I. The classification is formulated in terms of generalized Dirichlet characters. This ‘ideal-theoretic’ version of class field theory dates from the first half of the twentieth century. In this book, it is described in modern mathematical language. Another approach, the ‘idèlic version’, uses topological algebra and group cohomology and originated halfway the last century. The last two chapters provide the connection to this more advanced idèlic version of class field theory. The book focuses on the abstract theory and contains many examples and exercises. For quadratic number fields algorithms are given for their class groups and, in the real case, for the fundamental unit. New concepts are introduced at the moment it makes a real difference to have them available.

This book constitutes the refereed proceedings of the 11th Annual European Symposium on Algorithms, ESA 2003, held in Budapest, Hungary, in September 2003. The 66 revised full papers presented were carefully reviewed and selected from 165 submissions. The scope of the papers spans the entire range of algorithmics from design and mathematical analysis issues to real-world applications, engineering, and experimental analysis of algorithms.

The goal of this book is to describe the most powerful methods for evaluating multiloop Feynman integrals that are currently used in practice. This book supersedes the author’s previous Springer book “Evaluating Feynman Integrals” and its textbook version “Feynman Integral Calculus.” Since the publication of these two books, powerful new methods have arisen and conventional methods have been improved on in essential ways. A further qualitative change is the fact that most of the methods and the corresponding algorithms have now been implemented in computer codes which are often public. In comparison to the two previous books, three new chapters have been added: One is on sector decomposition, while the second describes a new method by Lee. The third new chapter concerns the asymptotic expansions of Feynman integrals in momenta and masses, which were described in detail in another Springer book, “Applied Asymptotic Expansions in Momenta and Masses,” by the author. This chapter describes, on the basis of papers that appeared after the publication of said book, how to algorithmically discover the regions relevant to a given limit within the strategy of expansion by regions. In addition, the chapters on the method of Mellin-Barnes representation and on the method of integration by parts have been substantially rewritten, with an emphasis on the corresponding algorithms and computer codes.