Muutke küpsiste eelistusi

Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra Fourth Edition 2015 [Kõva köide]

  • Formaat: Hardback, 646 pages, kõrgus x laius: 235x155 mm, kaal: 1293 g, 7 Illustrations, color; 88 Illustrations, black and white; XVI, 646 p. 95 illus., 7 illus. in color., 1 Hardback
  • Sari: Undergraduate Texts in Mathematics
  • Ilmumisaeg: 13-May-2015
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3319167200
  • ISBN-13: 9783319167206
  • Kõva köide
  • Hind: 44,06 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 51,84 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Formaat: Hardback, 646 pages, kõrgus x laius: 235x155 mm, kaal: 1293 g, 7 Illustrations, color; 88 Illustrations, black and white; XVI, 646 p. 95 illus., 7 illus. in color., 1 Hardback
  • Sari: Undergraduate Texts in Mathematics
  • Ilmumisaeg: 13-May-2015
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3319167200
  • ISBN-13: 9783319167206
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 co

urses 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(TM), 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 cons

ider 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

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.

Arvustused

In each of the new editions the authors' were interested to incorporate new developments, simplifications of arguments as well as further applications. Thanks to the authors' this is also the case in the present fourth edition. Thanks to the continuously updating the textbook will remain an excellent source for the computational Commutative Algebra for students as well as for researchers interested in learning the subject. (Peter Schenzel, zbMATH 1335.13001, 2016)

Preface vii
Notation for Sets and Functions xv
Chapter 1 Geometry, Algebra, and Algorithms
1(48)
§1 Polynomials and Affine Space
1(4)
§2 Affine Varieties
5(9)
§3 Parametrizations of Affine Varieties
14(15)
§4 Ideals
29(8)
§5 Polynomials of One Variable
37(12)
Chapter 2 Grobner Bases
49(72)
§1 Introduction
49(5)
§2 Orderings on the Monomials in k[ x1,...,xn]
54(7)
§3 A Division Algorithm in k[ x1,...,xn]
61(9)
§4 Monomial Ideals and Dickson's Lemma
70(6)
§5 The Hilbert Basis Theorem and Grobner Bases
76(7)
§6 Properties of Grobner Bases
83(7)
§7 Buchberger's Algorithm
90(7)
§8 First Applications of Grobner Bases
97(7)
§9 Refinements of the Buchberger Criterion
104(5)
§10 Improvements on Buchberger's Algorithm
109(12)
Chapter 3 Elimination Theory
121(54)
§1 The Elimination and Extension Theorems
121(8)
§2 The Geometry of Elimination
129(4)
§3 Implicitization
133(10)
§4 Singular Points and Envelopes
143(12)
§5 Grobner Bases and the Extension Theorem
155(6)
§6 Resultants and the Extension Theorem
161(14)
Chapter 4 The Algebra--Geometry Dictionary
175(58)
§1 Hilbert's Nullstellensatz
175(6)
§2 Radical Ideals and the Ideal--Variety Correspondence
181(8)
§3 Sums, Products, and Intersections of Ideals
189(10)
§4 Zariski Closures, Ideal Quotients, and Saturations
199(7)
§5 Irreducible Varieties and Prime Ideals
206(6)
§6 Decomposition of a Variety into Irreducibles
212(7)
§7 Proof of the Closure Theorem
219(9)
§8 Primary Decomposition of Ideals
228(4)
§9 Summary
232(1)
Chapter 5 Polynomial and Rational Functions on a Variety
233(58)
§1 Polynomial Mappings
233(7)
§2 Quotients of Polynomial Rings
240(8)
§3 Algorithmic Computations in k[ x1,...,xn]/I
248(9)
§4 The Coordinate Ring of an Affine Variety
257(11)
§5 Rational Functions on a Variety
268(9)
§6 Relative Finiteness and Noether Normalization
277(14)
Chapter 6 Robotics and Automatic Geometric Theorem Proving
291(54)
§1 Geometric Description of Robots
291(6)
§2 The Forward Kinematic Problem
297(7)
§3 The Inverse Kinematic Problem and Motion Planning
304(15)
§4 Automatic Geometric Theorem Proving
319(16)
§5 Wu's Method
335(10)
Chapter 7 Invariant Theory of Finite Groups
345(40)
§1 Symmetric Polynomials
345(10)
§2 Finite Matrix Groups and Rings of Invariants
355(9)
§3 Generators for the Ring of Invariants
364(9)
§4 Relations Among Generators and the Geometry of Orbits
373(12)
Chapter 8 Projective Algebraic Geometry
385(84)
§1 The Projective Plane
385(11)
§2 Projective Space and Projective Varieties
396(10)
§3 The Projective Algebra--Geometry Dictionary
406(9)
§4 The Projective Closure of an Affine Variety
415(7)
§5 Projective Elimination Theory
422(14)
§6 The Geometry of Quadric Hypersurfaces
436(15)
§7 Bezout's Theorem
451(18)
Chapter 9 The Dimension of a Variety
469(70)
§1 The Variety of a Monomial Ideal
469(4)
§2 The Complement of a Monomial Ideal
473(13)
§3 The Hilbert Function and the Dimension of a Variety
486(12)
§4 Elementary Properties of Dimension
498(8)
§5 Dimension and Algebraic Independence
506(9)
§6 Dimension and Nonsingularity
515(10)
§7 The Tangent Cone
525(14)
Chapter 10 Additional Grobner Basis Algorithms
539(54)
§1 Preliminaries
539(11)
§2 Hilbert Driven Buchberger Algorithms
550(17)
§3 The F4 Algorithm
567(9)
§4 Signature-based Algorithms and F5
576(17)
Appendix A Some Concepts from Algebra
593(6)
§1 Fields and Rings
593(1)
§2 Unique Factorization
594(1)
§3 Groups
595(1)
§4 Determinants
596(3)
Appendix B Pseudocode
599(4)
§1 Inputs, Outputs, Variables, and Constants
600(1)
§2 Assignment Statements
600(1)
§3 Looping Structures
600(2)
§4 Branching Structures
602(1)
§5 Output Statements
602(1)
Appendix C Computer Algebra Systems
603(16)
§1 General Purpose Systems: Maple, Mathematica, Sage
604(7)
§2 Special Purpose Programs: CoCoA, Macaulay2, Singular
611(6)
§3 Other Systems and Packages
617(2)
Appendix D Independent Projects
619(8)
§1 General Comments
619(1)
§2 Suggested Projects
620(7)
References 627(8)
Index 635
David A. Cox is currently Professor of Mathematics at Amherst College. John Little is currently Professor of Mathematics at College of the Holy Cross. Donal O'Shea is currently President and Professor of Mathematics at New College of Florida.