Du er her:
Bog, paperback Ideals, Varieties, and Algorithms af David A. Cox

Ideals, Varieties, and Algorithms (Undergraduate Texts in Mathematics)

- An Introduction to Computational Algebraic Geometry and Commutative Algebra

(Bog, paperback)

85 black & white illustrations, 10 colour illustrations, biography

85 black & white illustrations, 10 colour illustrations, biography


Softcover reprint of the original 4th ed. 2015
Vis mere

Sæt bog på liste

  • Bogliste

Forlagets pris
kr. 549,95
Forventes udgivet
Kan forudbestilles
Leveres senest

kr. 386,53
Din studiepris
kr. 19,95

kr. 329,95
Fri fragt

Du tilmelder dig Saxo Plusmedlemskab til 69 kr. hver måned. Se hvordan du sparer tre måneders Plusmedlemskab her

Til dig, der elsker bøger

Læs mere om Plusmedlemskab
Op til 70% rabat Fri fragt
Udvidet returret Ingen binding

Forlagets beskrivelse
85 black & white illustrations, 10 colour illustrations, biography
Bibliotekernes beskrivelse
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 Grobner 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(TM), Mathematica(R) 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

Kundernes boganmeldelser af Ideals, Varieties, and Algorithms (Undergraduate Texts in Mathematics)

Anmeld bogen og vær med i konkurrencen om gavekort – læs mere her.

Der ingen anmeldelser af Ideals, Varieties, and Algorithms (Undergraduate Texts in Mathematics)

for at skrive en anmeldelse.

Bogens kategori: