Matrix formulæ for resultants and discriminants of bivariate tensor-product polynomials (Q2284950)

The search of determinantal formulas for computing multivariate resultants, generalizing either (or both of) Sylvester and Bézout determinants in the univariate case, has a long history in computational algebra. In the paper under review, the authors make explicit such formulas for \(3\) bivariate polynomials with given degrees in each of the variables, not necessarily the same degree for all the polynomials. To do so, they make explicit a mixed determinantal Weyman complex which is exact if and only if the resultant does not vanish. They then show that some graded pieces of this complex only have two non zero terms, and also make explicit the maps between these two pieces. This allows them to present the resultant as the determinant of a matrix which surprisingly only has a ``Koszul part'', i.e. each entry of the matrix is either the coefficient of one of the input polynomials or zero (although the matrix does not correspond to a matrix of a Koszul-type map, like in the Sylvester's univariate case). This result is then applied to the study of usual properties of resultants like factorization and multiplicity, and also to discriminants of tensor product polynomial systems.