Sylvester's double sums: An inductive proof of the general case
; Szanto, Agnes Otros responsables
Fecha
2012-01-30
Editorial
Elsevier
Revista
Journal Of Symbolic Computation
Título del libro
Nombre del evento
Fecha del evento
Institución organizadora
ISSN
0747-7171
eISSN
ISBN
Idioma
Inglés
Tipo del evento
Clasificación temática
Palabras clave
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.
Colecciones
Aprobación
Revisión
Complementado por
Referenciado por
Licencia Creative Commons
Excepto donde se indique lo contrario, la licencia de este ítem se describe como by-nc-nd
