On the combinatorics and computation of sparse resultants

CARLOS D'ANDREA; GABRIELA JERONIMO; MARTÍN SOMBRA

Buenos Aires

Conferencia; Computational Algebra, Algebraic Geometry and Applications; 2016

Recently, a new definition for the sparse resultant associated to n+1 Laurent polynomials in n variables with given supports has been introduced. It produces more uniform statements and enables the extension of previous results to arbitrary collections of supports.We will discuss factorization formulas for initial forms and for degrees of homogenizationof the new sparse resultant, and we will present a simplified recursive formulation to produce Macaulay stlye formulae for this resultant.This is a joint work with Carlos D'Andrea and Martín Sombra.