On the computation of sparse resultants

JERONIMO, GABRIELA

Atlanta

Conferencia; SIAM Conference on Applied Algebraic Geometry; 2017

Society for Industrial and Applied Mathematics (SIAM)

Recently, the notion of sparse resultant associated to n+1 Laurent polynomials with supports in finite subsets of Z^n has been redefined and studied using multiprojective elimination theory.This approach produces more uniform statements and allows to extend known results to arbitrary collections of supports.In this talk, we will present a new recursive construction to produce Macaulay style formulas to compute the sparse resultant as a quotient of the determinant of a Sylvester type matrix by one of its minors without imposing any conditions on the support sets, simplifying and generalizing the formulas in previous work by D´Andrea (2002).This is joint work with Carlos D´Andrea and Martín Sombra.