Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 2,034

The DOI matches its Crossref record.

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

·1993·Choice Reviews Online

Abstract

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 geometrythe elimination theorem, the extension theorem, the closure theorem and the Nullstellensatzthis 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 Grbner 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, 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 Buchbergers 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, 2007I 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

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.5860/choice.30-5053

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 2,034

Metadata

Venue
Choice Reviews Online
Published
1993-05-01
Volume
30
Issue
09
Pages
30-5053-30-5053
ISSN
  • 0009-4978 (ISSN-L)
  • 1523-8253
OpenAlex
W1518341038
Cited by
2,034
References
0
Type
book review
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Ideals, varieties, and algorithms: an introduction to computational algebraic geometry and commutative algebra. https://app.cochat.ai/papers/10.5860/choice.30-5053
The paper
Ideals, varieties, and algorithms: an introduction to computational algebraic geometry and commutative algebra. (1993). Choice Reviews Online. https://doi.org/10.5860/choice.30-5053

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.