الصفحة 1
الصفحة 1
Number Theory ; Vol. II : Analytic and Modern Tools
The central theme of this graduate-level number theory textbook is the solution of Diophantine equations, i.e., equations or systems of polynomial equations which must be solved in integers, rational numbers or more generally in algebraic numbers. This theme, in particular, is the central motivation for the modern theory of arithmetic algebraic geometry. In this text, this is considered through three aspects.
Number Theory ; Vol. I : Tools and Diophantine Equations
The central theme of this graduate-level number theory textbook is the solution of Diophantine equations, i.e., equations or systems of polynomial equations which must be solved in integers, rational numbers or more generally in algebraic numbers. This theme, in particular, is the central motivation for the modern theory of arithmetic algebraic geometry. In this text, this is considered through three aspects.
Ideals, Varieties, and Algorithms : An Introduction to Computational Algebraic Geometry and Commutative Algebra
Algebraic Geometry is the study of systems of polynomial equations in one or more variables.The solutions of a system of polynomial equations form a geometric object called a variety; the corresponding algebraic object is an ideal. There is a close relationship between ideals and varieties which reveals the intimate link between algebra and geometry. Written at a level appropriate to undergraduates, this book covers such topics as the Hilbert Basis Theorem, the Nullstellensatz, invariant theory, projective geometry, and dimension theory.
Computing in Algebraic Geometry : A Quick Start using SINGULAR
Algebraic geometry generally studies the properties of solution sets of systems of polynomial equations without direct reference to the actual polynomials used in these systems. … This is especially desirable for classwork where the development of the abstract machinery generally outlasts the patience of the students, except possibly the most motivated ones.
Algorithms in Real Algebraic Geometry
The algorithmic problems of real algebraic geometry such as real root counting, deciding the existence of solutions of systems of polynomial equations and inequalities, finding global maxima or deciding whether two points belong in the same connected component of a semi-algebraic set appear frequently in many areas of science and engineering. In this first-ever graduate textbook on the algorithmic aspects of real algebraic geometry, the main ideas and techniques presented form a coherent and rich body of knowledge, linked to many areas of mathematics and computing.
A Field Guide to Algebra
Focuses on the structure of fields and is intended for a second course in abstract algebra. Besides providing proofs of the transcendance of pi and e, the book includes material on differential Galois groups and a proof of Hilbert's irreducibility theorem. The reader will hear about equations, both polynomial and differential, and about the algebraic structure of their solutions. In explaining these concepts, the author also provides comments on their historical development and leads the reader along many interesting paths. In addition, there are theorems from analysis: as stated before, the transcendence of the numbers pi and e, the fact that the complex numbers form an algebraically closed field, and also Puiseux's theorem that shows how one can parametrize the roots of polynomial equations, the coefficients of which are allowed to vary. There are exercises at the end of each chapter, varying in degree from easy to difficult. To make the book more lively, the author has incorporated pictures from the history of mathematics, including scans of mathematical stamps and pictures of mathematicians.
