Ideals Varieties And Algorithms

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. Contains a new section on Axiom and an update about MAPLE, Mathematica and REDUCE.

An illustration of the many uses of algebraic geometry, highlighting the more recent applications of Groebner bases and resultants. Along the way, the authors provide an introduction to some algebraic objects and techniques more advanced than typically encountered in a first course. The book is accessible to non-specialists and to readers with a diverse range of backgrounds, assuming readers know the material covered in standard undergraduate courses, including abstract algebra. But because the text is intended for beginning graduate students, it does not require graduate algebra, and in particular, does not assume that the reader is familiar with modules.

Algorithmic Algebra studies some of the main algorithmic tools of computer algebra, covering such topics as Gröbner bases, characteristic sets, resultants and semialgebraic sets. The main purpose of the book is to acquaint advanced undergraduate and graduate students in computer science, engineering and mathematics with the algorithmic ideas in computer algebra so that they could do research in computational algebra or understand the algorithms underlying many popular symbolic computational systems: Mathematica, Maple or Axiom, for instance. Also, researchers in robotics, solid modeling, computational geometry and automated theorem proving community may find it useful as symbolic algebraic techniques have begun to play an important role in these areas. The book, while being self-contained, is written at an advanced level and deals with the subject at an appropriate depth. The book is accessible to computer science students with no previous algebraic training. Some mathematical readers, on the other hand, may find it interesting to see how algorithmic constructions have been used to provide fresh proofs for some classical theorems. The book also contains a large number of exercises with solutions to selected exercises, thus making it ideal as a textbook or for self-study.

This book is both an easy-to-read textbook for invariant theory and a challenging research monograph that introduces a new approach to the algorithmic side of invariant theory. Students will find the book an easy introduction to this "classical and new" area of mathematics. Researchers in mathematics, symbolic computation, and computer science will get access to research ideas, hints for applications, outlines and details of algorithms, examples and problems.

Algebraic Geometry is a fascinating branch of Mathematics that combines methods from both Algebra and Geometry. It transcends the limited scope of pure Algebra by means of geometric construction principles. Putting forward this idea, Grothendieck revolutionized Algebraic Geometry in the late 1950s by inventing schemes. Schemes now also play an important role in Algebraic Number Theory, a field that used to be far away from Geometry. The new point of view paved the way for spectacular progress, such as the proof of Fermat's Last Theorem by Wiles and Taylor. This book explains the scheme-theoretic approach to Algebraic Geometry for non-experts, while more advanced readers can use it to broaden their view on the subject. A separate part presents the necessary prerequisites from Commutative Algebra, thereby providing an accessible and self-contained introduction to advanced Algebraic Geometry. Every chapter of the book is preceded by a motivating introduction with an informal discussion of its contents and background. Typical examples, and an abundance of exercises illustrate each section. Therefore the book is an excellent companion for self-studying or for complementing skills that have already been acquired. It can just as well serve as a convenient source for (reading) course material and, in any case, as supplementary literature. The present edition is a critical revision of the earlier text.

This book details the heart and soul of modern commutative and algebraic geometry. It covers such topics as the Hilbert Basis Theorem, the Nullstellensatz, invariant theory, projective geometry, and dimension theory. In addition to enhancing the text of the second edition, with over 200 pages reflecting changes to enhance clarity and correctness, this third edition of Ideals, Varieties and Algorithms includes: a significantly updated section on Maple; updated information on AXIOM, CoCoA, Macaulay 2, Magma, Mathematica and SINGULAR; and presents a shorter proof of the Extension Theorem.

This is a comprehensive review of commutative algebra, from localization and primary decomposition through dimension theory, homological methods, free resolutions and duality, emphasizing the origins of the ideas and their connections with other parts of mathematics. The book gives a concise treatment of Grobner basis theory and the constructive methods in commutative algebra and algebraic geometry that flow from it. Many exercises included.

Algebraic geometry is, essentially, the study of the solution of equations and occupies a central position in pure mathematics. This short and readable introduction to algebraic geometry will be ideal for all undergraduate mathematicians coming to the subject for the first time. With the minimum of prerequisites, Dr Reid introduces the reader to the basic concepts of algebraic geometry including: plane conics, cubics and the group law, affine and projective varieties, and non-singularity and dimension. He is at pains to stress the connections the subject has with commutative algebra as well as its relation to topology, differential geometry, and number theory. The book arises from an undergraduate course given at the University of Warwick and contains numerous examples and exercises illustrating the theory.