Constructive Ideal Theory

  • Harm Derksen
  • Gregor Kemper
Part of the Encyclopaedia of Mathematical Sciences book series (EMS, volume 130)


In this chapter we will provide the basic algorithmic tools which will be used in later chapters. More precisely, we introduce some algorithms of constructive ideal theory, almost all of which are based on Gröbner bases. As the reader will find out, these algorithms and thus Gröbner bases literally permeate this book. When Sturmfels’ book [239] was published, not much introductory literature on Gröbner bases and their applications was available. In contrast, we now have the books by Becker and Weispfenning [15], Adams and Loustaunau [6], Cox et al. [48], Vasconcelos [250], Cox et al. [49], Kreuzer and Robbiano [155], and a chapter from Eisenbud [59]. This list of references could be continued further. We will draw heavily on these sources and restrict ourselves to giving a rather short overview of the part of the theory that we require. The algorithms introduced in Sections 1.1–1.3 of this chapter have efficient implementations in various computer algebra systems, such as CoCoA [40], MACAULAY (2) [97], MAGMA [24], or SINGULAR [99], to name just a few, rather specialized ones. The normalization algorithm explained in Section 1.6 is implemented in MACAULAY and SINGULAR.


Normal Form Prime Ideal Polynomial Ring Hilbert Series Monomial Ideal 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Harm Derksen
    • 1
  • Gregor Kemper
    • 2
  1. 1.Department of MathematicsUniversity of MichiganAnn ArborUSA
  2. 2.Institute for Scientific ComputingUniversity of HeidelbergHeidelbergGermany

Personalised recommendations