Relation ideals and the Buchberger--M\"oller algorithm
From MaRDI portal
Publication:6474697
arXivmath/0411261MaRDI QIDQ6474697FDOQ6474697
Authors: Mathias Lederer 
Publication date: 11 November 2004
Abstract: We construct a Gr"obner Basis of the relation ideal of a polynomial, give an interpolation formula for the basis elements and explain the connection of the interpolation formula to the Buchberger--M"oller algorithm. We present a situation in which the usage of the Buchberger--M"oller algorithm is obsolete since one can compute its result directly. We prove a constructive version of a theorem of Galois, concerning the solvability of rational polynomials of prime degree. Computations are carried out for a number of example polynomials.
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Separable extensions, Galois theory (12F10)
This page was built for publication: Relation ideals and the Buchberger--M\"oller algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6474697)
