On Computing the Elimination Ideal Using Resultants with Applications to Gr\"obner Bases
Commutative Algebra
2015-11-02 v2 Symbolic Computation
Abstract
Resultants and Gr\"obner bases are crucial tools in studying polynomial elimination theory. We investigate relations between the variety of the resultant of two polynomials and the variety of the ideal they generate. Then we focus on the bivariate case, in which the elimination ideal is principal. We study - by means of elementary tools - the difference between the multiplicity of the factors of the generator of the elimination ideal and the multiplicity of the factors of the resultant.
Cite
@article{arxiv.1307.5330,
title = {On Computing the Elimination Ideal Using Resultants with Applications to Gr\"obner Bases},
author = {Matteo Gallet and Hamid Rahkooy and Zafeirakis Zafeirakopoulos},
journal= {arXiv preprint arXiv:1307.5330},
year = {2015}
}
Comments
7 pages