Ideals, varieties, and algorithms : an introduction to computational algebraic geometry and commutative algebra /

Saved in:

Bibliographic Details
Author / Creator:	Cox, David A.
Edition:	3rd ed.
Imprint:	New York : Springer, c2007.
Description:	1 online resource (xv, 551 p.) : ill.
Language:	English
Series:	Undergraduate texts in mathematics Undergraduate texts in mathematics.
Subject:	Geometry, Algebraic -- Data processing. Commutative algebra -- Data processing. Commutative algebra -- Data processing. Geometry, Algebraic -- Data processing.
Format:	E-Resource Book
URL for this record:	http://pi.lib.uchicago.edu/1001/cat/bib/8882580

Hidden Bibliographic Details
Other authors / contributors:	Little, John B. O'Shea, Donal.
ISBN:	9780387356518 0387356517 9780387356501 (acid-free paper) 0387356509 (acid-free paper) 6611336494 9786611336493
Notes:	Includes bibliographical references (p. 535-539) and index. Description based on print version record.
Summary:	"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."--Jacket.
Other form:	Print version: Cox, David A. Ideals, varieties, and algorithms. 3rd ed. New York : Springer, c2007 9780387356501 0387356509

Similar Items