Introduction

  • David Cox
  • John Little
  • Donal O’Shea
Part of the Graduate Texts in Mathematics book series (GTM, volume 185)

Abstract

Algebraic geometry is the study of geometric objects defined by polynomial equations, using algebraic means. Its roots go back to Descartes’ introduction of coordinates to describe points in Euclidean space and his idea of describing curves and surfaces by algebraic equations. Over the long history of the subject, both powerful general theories and detailed knowledge of many specific examples have been developed. Recently, with the development of computer algebra systems and the discovery (or rediscovery) of algorithmic approaches to many of the basic computations, the techniques of algebraic geometry have also found significant applications, for example in geometric design, combinatorics, integer programming, coding theory, and robotics. Our goal in Using Algebraic Geometry is to survey these algorithmic approaches and many of their applications.

Keywords

Prime Ideal Radical Ideal Total Degree Computer Algebra System Division Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1998

Authors and Affiliations

  • David Cox
    • 1
  • John Little
    • 2
  • Donal O’Shea
    • 3
  1. 1.Department of Mathematics and Computer ScienceAmherst CollegeAmherstUSA
  2. 2.Department of MathematicsCollege of the Holy CrossWorcesterUSA
  3. 3.Department of Mathematics, Statistics and Computer ScienceMount Holyoke CollegeSouth HadleyUSA

Personalised recommendations