Donal O'Shea – författare

This text covers topics in algebraic geometry and commutative algebra with careful attention to their 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—there are chapters on polynomial and rational functions between varieties, robotics and geometric theorem proving, invariant theory of finite groups, projective algebraic geometry, dimension theory, and progress made over the last decades in computing Gröbner bases.The fifth edition builds on the fourth edition in two main ways. First, a number of typographical errors, found by readers and by the authors since 2018, have been corrected. Second, new material on toric varieties, monomial curves, and other topics of current interest in algebraic geometry has been added. This enhances the opportunities for active learning through new examples, new exercises, and new projects in Appendix D, all supplemented by additional references. The book also includes updated computer algebra material in Appendix C.The book may be used for a first or second course in undergraduate abstract algebra and, with some augmentation perhaps, for beginning graduate courses in algebraic geometry or computational commutative 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 Maple™, Mathematica® and SageMath, 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

The Poincaré Conjecture tells the story behind one of the world’s most confounding mathematical theories. Formulated in 1904 by Henri Poincaré, his Conjecture promised to describe the very shape of the universe, but remained unproved until a huge prize was offered for its solution in 2000. Six years later, an eccentric Russian mathematician had the answer.Here, Donal O’Shea explains the maths behind the Conjecture and its proof, and illuminates the curious personalities surrounding this perplexing conundrum, along the way taking in a grand sweep of scientific history from the ancient Greeks to Christopher Columbus. This is an enthralling tale of human endeavour, intellectual brilliance and the thrill of discovery.

The Poincaré Conjecture tells the story behind one of the world’s most confounding mathematical theories. Formulated in 1904 by Henri Poincaré, his Conjecture promised to describe the very shape of the universe, but remained unproved until a huge prize was offered for its solution in 2000. Six years later, an eccentric Russian mathematician had the answer.Here, Donal O’Shea explains the maths behind the Conjecture and its proof, and illuminates the curious personalities surrounding this perplexing conundrum, along the way taking in a grand sweep of scientific history from the ancient Greeks to Christopher Columbus. This is an enthralling tale of human endeavour, intellectual brilliance and the thrill of discovery.

In 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.

In 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.

In 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.

We wrote this book to introduce undergraduates to some interesting ideas in algebraic geometry and commutative algebra. Until recently, these topics involved a lot of abstract mathematics and were only taught in graduate school. But in the 1960''s, Buchberger and Hironaka discovered new algorithms for manipulating systems of polynomial equations. Fueled by the development of computers fast enough to run these algorithms, the last two decades have seen a minor revolution in commutative algebra. The ability to compute efficiently with polynomial equations has made it possible to investigate complicated examples that would be impossible to do by hand, and has changed the practice of much research in algebraic geometry. This has also enhanced the importance of the subject for computer scientists and engineers, who have begun to use these techniques in a whole range of problems. It is our belief that the growing importance of these computational techniques warrants their introduction into the undergraduate (and graduate) mathematics curricu­ lum. Many undergraduates enjoy the concrete, almost nineteenth century, flavor that a computational emphasis brings to the subject. At the same time, one can do some substantial mathematics, including the Hilbert Basis Theorem, Elimination Theory and the Nullstellensatz. The mathematical prerequisites of the book are modest: the students should have had a course in linear algebra and a course where they learned how to do proofs. Examples of the latter sort of course include discrete math and abstract algebra.

Algebraic Geometry is the study of systems of polynomial equations in one or more variables, asking such questions as: Does the system have finitely many solutions, and if so how can one find them? And if there are infinitely many solutions, how can they be described and manipulated? 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. The algorithms to answer questions such as those posed above are an important part of algebraic geometry. This book bases its discussion of algorithms on a generalization of the division algorithm for polynomials in one variable that was only discovered in the 1960''s. Although the algorithmic roots of algebraic geometry are old, the computational aspects were neglected earlier in this century. This has changed in recent years, and new algorithms, coupled with the power of fast computers, have let to some interesting applications, for example in robotics and in geometric theorem proving. In preparing a new edition of Ideals, Varieties and Algorithms the authors present an improved proof of the Buchberger Criterion as well as a proof of Bezout''s Theorem. Appendix C contains a new section on Axiom and an update about Maple , Mathematica and REDUCE.

In 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"obner 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"obner bases. The book does not assume the reader is familiar with more advanced concepts such as modules.

This text covers topics in algebraic geometry and commutative algebra with careful attention to their 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—there are chapters on polynomial and rational functions between varieties, robotics and geometric theorem proving, invariant theory of finite groups, projective algebraic geometry, dimension theory, and progress made over the last decades in computing Gröbner bases.The fifth edition builds on the fourth edition in two main ways. First, a number of typographical errors, found by readers and by the authors since 2018, have been corrected. Second, new material on toric varieties, monomial curves, and other topics of current interest in algebraic geometry has been added. This enhances the opportunities for active learning through new examples, new exercises, and new projects in Appendix D, all supplemented by additional references. The book also includes updated computer algebra material in Appendix C.The book may be used for a first or second course in undergraduate abstract algebra and, with some augmentation perhaps, for beginning graduate courses in algebraic geometry or computational commutative 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 Maple™, Mathematica® and SageMath, 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

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 levelcourses 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 Maple™, 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.Readers who are teaching from Ideals, Varieties, and Algorithms, or are studying the book on their own, may obtain a copy of the solutions manual by sending an email to jlittle@holycross.edu.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