|
![]() |
|||
|
||||
OverviewIn recent years, the discovery of new algorithms for dealing with polynomial equations, coupled with their implementation on fast inexpensive computers, has sparked a minor revolution in the study and practice of algebraic geometry. These algorithmic methods have also given rise to some exciting new applications of algebraic geometry. This book illustrates the many uses of algebraic geometry, highlighting some of the more recent applications of Gröbner bases and resultants. In order to do this, the authors provide an introduction to some algebraic objects and techniques which are more advanced than one typically encounters in a first course, but nonetheless of great utility. The book is written for nonspecialists and for readers with a diverse range of backgrounds. It assumes knowledge of the material covered in a standard undergraduate course in abstract algebra, and it would help to have some previous exposure to Gröbner bases. The book does not assume the reader is familiar with more advanced concepts such as modules. For this new edition the authors added two new sections and a new chapter, updated the references and made numerous minor improvements throughout the text. Full Product DetailsAuthor: David A. Cox , John Little , Donal O'SheaPublisher: Springer-Verlag New York Inc. Imprint: Springer-Verlag New York Inc. Edition: 2nd ed. 2005 Volume: 185 Dimensions: Width: 15.50cm , Height: 3.10cm , Length: 23.50cm Weight: 1.039kg ISBN: 9780387207063ISBN 10: 0387207066 Pages: 575 Publication Date: 09 March 2005 Audience: Professional and scholarly , Professional & Vocational Format: Hardback Publisher's Status: Active Availability: Out of stock ![]() The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available. Table of ContentsSolving Polynomial Equations.- Resultants.- Computation in Local Rings.- Modules.- Free Resolutions.- Polytopes, Resultants, and Equations.- Polyhedral Regions and Polynomials.- Algebraic Coding Theory.- The Berlekamp-Massey-Sakata Decoding Algorithm.ReviewsFrom the reviews of the second edition: The book has been very successful. It succeeded in establishing a bridge between modern computer science and classical algebraic geometry. (Gerhard Pfister, Zentralblatt MATH, Vol. 1079, 2006) The authors a ] do not expect much from their reader in terms of mathematical prerequisites. a ] This reviewer thinks that the part of the intended audience consisting of graduate students interested in research in computational algebraic geometry will find this to be a very useful book. The many exercises throughout the text, and the mere fact that this is a very good and detailed overview of the subject will definitely make it desirable for this group. (Gizem Karaali, MathDL, September, 2005) From the reviews of the second edition: <p> The book has been very successful. It succeeded in establishing a bridge between modern computer science and classical algebraic geometry. (Gerhard Pfister, Zentralblatt MATH, Vol. 1079, 2006) <p> The authors a ] do not expect much from their reader in terms of mathematical prerequisites. a ] This reviewer thinks that the part of the intended audience consisting of graduate students interested in research in computational algebraic geometry will find this to be a very useful book. The many exercises throughout the text, and the mere fact that this is a very good and detailed overview of the subject will definitely make it desirable for this group. (Gizem Karaali, MathDL, September, 2005) Author InformationTab Content 6Author Website:Countries AvailableAll regions |