Relation ideals and the Buchberger--Möller algorithm
| dc.creator | Lederer, Mathias | |
| dc.date | 2004-11-11 | |
| dc.date.accessioned | 2026-07-07T05:14:14Z | |
| dc.date.available | 2026-07-07T05:14:14Z | |
| dc.description | We construct a Gröbner 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öller algorithm. We present a situation in which the usage of the Buchberger--Möller 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. | |
| dc.description | 33 pages | |
| dc.identifier | https://arxiv.org/abs/math/0411261 | |
| dc.identifier | http://arxiv.org/abs/math/0411261 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/73196 | |
| dc.subject | Number Theory | |
| dc.subject | Commutative Algebra | |
| dc.subject | 12F10; 13P10 | |
| dc.title | Relation ideals and the Buchberger--Möller algorithm | |
| dc.type | text |