zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra. 2nd ed. (English) Zbl 0861.13012
Undergraduate Texts in Mathematics. New York, NY: Springer. xiii, 536 p. DM 68.00; öS 496.40; sFr 60.00 (1996).
Buchberger’s algorithm is an important tool for computations in commutative algebra and algebraic geometry. Using this algorithm one can compute a Gröbner base of an ideal in a polynomial ring (or, more generally, of a submodule of a free module over a polynomial ring). This algorithm is implemented in many computer algebra systems, which allow the effective performance of many constructions in algebra and algebraic geometry (e.g., syzygies, Hilbert polynomials, primary decomposition, etc.). -- The book gives a good introduction into these problems. On the base of an introduction to algebraic geometry and the relationship between algebra and algebraic geometry, Buchberger’s algorithm is explained. First applications are solutions of the ideal membership problem, solving polynomial equations followed by the chapter about elimination theory. -- The book contains also applications concerning robotics, automatic geometry theorem proving, invariant theory of finite groups. The computational question is always related to basic topics of algebraic geometry (Hilbert basis theorem, the Nullstellensatz, invariant theory, projective geometry, dimension theory, etc.). In an appendix several computer algebra systems (Maple, Mathematica, Reduce, etc.) are introduced and discussed. -- The book contains a lot of exercises. It is a good introduction for students of algebraic geometry taking care of the growing importance of computational techniques. Compared to the first edition, some proofs have been improved, some chapters have been rewritten, respectively added (for instance, one chapter with Bezout’s theorem).

13P10Gröbner bases; other bases for ideals and modules
14Q99Computational aspects of algebraic geometry
13F20Polynomial rings and ideals
14-02Research monographs (algebraic geometry)
13-02Research monographs (commutative algebra)