Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Conceived in 1904, the Poincare conjecture, a puzzle that speaks to the possible shape of the universe and lies at the heart of modern topology and geometry, has resisted attempts by generations of mathematicians to prove or to disprove it. Despite a million-dollar prize for a solution, Russian mathematician Grigory Perelman, posted his solution on the Internet instead of publishing it in a peer-reviewed journal. This book "tells the story of the fascinating personalities, institutions, and scholarship behind the centuries of mathematics that have led to Perelman's dramatic proof." The author also chronicles dramatic events at the 2006 International congress of mathematicians in Madrid, where Perelman was awarded a Fields Medal for his solution, which he declined

Algebraic topology --- Mathematics --- Mathematicians --- Poincaré, Henri, - 1854-1912 --- Perelman, Grigori, - 1966-

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This text covers topics in algebraic geometry and commutative algebra with a strong perspective toward practical and computational aspects. The first four chapters form the core of the book. A comprehensive chart in the preface illustrates a variety of ways to proceed with the material once these chapters are covered. In addition to the fundamentals of algebraic geometry—the elimination theorem, the extension theorem, the closure theorem, and the Nullstellensatz—this new edition incorporates several substantial changes, all of which are listed in the Preface. The largest revision incorporates a new chapter (ten), which presents some of the essentials of progress made over the last decades in computing Gröbner bases. The book also includes current computer algebra material in Appendix C and updated independent projects (Appendix D). The book may serve as a first or second course in undergraduate abstract algebra and, with some supplementation perhaps, for beginning graduate level courses in algebraic geometry or computational algebra. Prerequisites for the reader include linear algebra and a proof-oriented course. It is assumed that the reader has access to a computer algebra system. Appendix C describes features of MapleTM, Mathematica®, and Sage, as well as other systems that are most relevant to the text. Pseudocode is used in the text; Appendix B carefully describes the pseudocode used. From the reviews of previous editions: “...The book gives an introduction to Buchberger’s algorithm with applications to syzygies, Hilbert polynomials, primary decompositions. There is an introduction to classical algebraic geometry with applications to the ideal membership problem, solving polynomial equations, and elimination theory. ...The book is well-written. ...The reviewer is sure that it will be an excellent guide to introduce further undergraduates in the algorithmic aspect of commutative algebra and algebraic geometry.” —Peter Schenzel, zbMATH, 2007 “I consider the book to be wonderful. ... The exposition is very clear, there are many helpful pictures, and there are a great many instructive exercises, some quite challenging ... offers the heart and soul of modern commutative and algebraic geometry.” —The American Mathematical Monthly.

Mathematical logic --- Ordered algebraic structures --- Geometry --- Mathematical control systems --- Computer architecture. Operating systems --- Computer. Automation --- algebra --- landmeetkunde --- bedrijfssoftware --- informatica --- wiskunde --- logica