Artículos de revistas
Sylvester's double sums: an inductive proof of the general case
Fecha
2012-01-30Registro en:
Krick, Teresa Elena Genoveva; Szanto, Agnes; Sylvester's double sums: an inductive proof of the general case; Elsevier; Journal Of Symbolic Computation; 47; 8; 30-1-2012; 942-953
0747-7171
Autor
Krick, Teresa Elena Genoveva
Szanto, Agnes
Resumen
In 1853, Sylvester introduced a family of double sum expressions for two finite sets of indeterminates and showed that some members of the family are essentially the polynomial subresultants of the monic polynomials associated with these sets. In 2009, in a joint work with C. D’Andrea and H. Hong we gave the complete description of all the members of the family as expressions in the coefficients of these polynomials. More recently, M.-F. Roy and A. Szpirglas presented a new and natural inductive proof for the cases considered by Sylvester. Here we show how induction also allows to obtain the full description of Sylvester’s double-sums.