arXiv · 1307.5330
On Computing the Elimination Ideal Using Resultants with Applications to Gr\"obner Bases
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.
Explore related subjects
Keep this discovery
Matteo Gallet, Hamid Rahkooy, Zafeirakis Zafeirakopoulos. 2013-07-19. On Computing the Elimination Ideal Using Resultants with Applications to Gr\"obner Bases. https://arxiv.org/abs/1307.5330
Cite the original work for its findings. Save a collection to share your selection of sources.