Könyv Ideals, Varieties, and Algorithms David A. Cox

Ideals, Varieties, and Algorithms

An Introduction to Computational Algebraic Geometry and Commutative Algebra

Nyelv: Angol
Kötés: Kemény kötésű
Elérhetőség: Beszállítói készleten
Küldés 10-13 napon belül
30 084 Ft
This text covers topics in algebraic geometry and commutative algebra with careful attention to thei...

Információk a könyvről

Nyelv
Angol
Kötés
Könyv - Kemény kötésű
Kiadva
2025
oldal
675
EAN
9783031918407
Enbook ID
48313565
Súly
1110
Méretek
155 x 235

Teljes leírás

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

Érdekelheti

11 926 Ft

Live & Lead as If You Matter

James E Akenhead Ed D
5 481 Ft

Social defence

BRIAN MARTIN
6 883 Ft

Life Force

Tony Robbins
10 113 Ft
7 495 Ft

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták

8 893 Ft
15 495 Ft

Krew nas połączy

Łukasz Damaziak
3 640 Ft
340 Ft

Túl a feketén

Claire Castillon
2 110 Ft

Jamais plus

Colleen Hoover
3 158 Ft
3 940 Ft
8 143 Ft

Wurzeln 'Roots'

Emil U. Günther
7 085 Ft