Computational algebraic geometry and polynomial-ideal theory

Abstract

Among the fundamental objects studied in algebraic geometry are algebraic varieties which are aggregates of common zeros of polynomial sets, viewed as points in an affine space. In contrast, ideals generated by polynomial sets are typical examples dealt with in commutative algebra. Elimination algorithms provide powerful constructive tools for many problems in these two related areas. In this chapter, we investigate some computational aspects of a few such problems.