Sylvester's double sums: an inductive proof of the general case

dc.creatorKrick, Teresa Elena Genoveva
dc.creatorSzanto, Agnes
dc.date.accessioned2017-04-06T20:46:13Z
dc.date.accessioned2018-11-06T12:54:25Z
dc.date.available2017-04-06T20:46:13Z
dc.date.available2018-11-06T12:54:25Z
dc.date.created2017-04-06T20:46:13Z
dc.date.issued2012-01-30
dc.identifierKrick, 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
dc.identifier0747-7171
dc.identifierhttp://hdl.handle.net/11336/14934
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1871043
dc.description.abstractIn 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.
dc.languageeng
dc.publisherElsevier
dc.relationinfo:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S0747717112000041
dc.relationinfo:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.1016/j.jsc.2012.01.003
dc.rightshttps://creativecommons.org/licenses/by-nc-nd/2.5/ar/
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subjectsubresultants
dc.subjectdouble-sum formula
dc.subjectinduction
dc.titleSylvester's double sums: an inductive proof of the general case
dc.typeArtículos de revistas
dc.typeArtículos de revistas
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución