Introduction to Groebner bases

From MaRDI portal





The paper contains a summary of four lectures given by the author at the summer school in Marktoberdorf in 1995. In the first lecture the author gives several examples in order to show the applications of Gröbner bases techniques. The examples are quite different: one is taken from invariant theory, another regards geometry theorem proving, the third regards a formula (connecting Fermat polynomials and elementary symmetric polynomials) that can be easily conjectured from Gröbner bases computations etc. The second lecture contains the main definitions and results of Gröbner bases theory: In particular it contains a detailed exposition of the reduction algorithm, its several properties and it gives a proof of the main theorem on Gröbner bases (i.e. Buchberger algorithm). The third lecture is devoted to some applications of Gröbner bases (membership and radical membership problem, computations in residue rings, syzygies, Hilbert function, elimination of variables, operations with ideals, etc.). Finally, the fourth lecture shortly discusses the possible interactions between algorithmic techniques and software capabilities of logical and algebraic systems. The aim is that of developing a software able to prove formulae automatically and execute them as soon as they represent an algorithm. For the entire collection see [Zbl 0869.00051].











This page was built for publication: Introduction to Groebner bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4357060)