---

＜電子ブック＞
Ideals, Varieties, and Algorithms : An Introduction to Computational Algebraic Geometry and Commutative Algebra / by David A. Cox, John Little, Donal O'Shea
(Undergraduate Texts in Mathematics. ISSN:21975604)

版	4th ed. 2015.
出版者	(Cham : Springer International Publishing : Imprint: Springer)
出版年	2015
本文言語	英語
大きさ	XVI, 646 p. 95 illus., 7 illus. in color : online resource
著者標目	*Cox, David A author Little, John author O'Shea, Donal author SpringerLink (Online service)
件　名	LCSH:Algebraic geometry LCSH:Commutative algebra LCSH:Commutative rings LCSH:Mathematical logic LCSH:Computer software FREE:Algebraic Geometry FREE:Commutative Rings and Algebras FREE:Mathematical Logic and Foundations FREE:Mathematical Software
一般注記	Preface -- Notation for Sets and Functions -- 1. Geometry, Algebra, and Algorithms -- 2. Groebner Bases -- 3. Elimination Theory -- 4.The Algebra-Geometry Dictionary -- 5. Polynomial and Rational Functions on a Variety -- 6. Robotics and Automatic Geometric Theorem Proving -- 7. Invariant Theory of Finite Groups -- 8. Projective Algebraic Geometry -- 9. The Dimension of a Variety -- 10. Additional Groebner Basis Algorithms -- Appendix A. Some Concepts from Algebra -- Appendix B. Pseudocode -- Appendix C. Computer Algebra Systems -- Appendix D. Independent Projects -- References -- Index. 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 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. 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 HTTP:URL=https://doi.org/10.1007/978-3-319-16721-3

 類似資料