An Elementary Proof of Sylvester's Double Sums for Subresultants
Carlos D'Andrea, Hoon Hong, Teresa Krick, Agnes Szanto
Abstract
In 1853 Sylvester stated and proved an elegant formula that expresses the polynomial subresultants in terms of the roots of the input polynomials. Sylvester's formula was also recently proved by Lascoux and Pragacz by using multi-Schur functions and divided differences. In this paper, we provide an elementary proof that uses only basic properties of matrix multiplication and Vandermonde determinants.
Create a lesson
Related papers
A Relative Telescope-Type Conjecture: Support and Generation in Half-Bounded Derived Categories
Liangyu Zhu
Associated primes in group cohomology and a strange result
James A. Schafer
Minimal cellular resolutions of complementary edge ideals
Somayeh Moradi
On a question of Takahashi concerning direct summands of syzygies
Luigi Ferraro
On Bayart's unique factorization problem
Elad Paran
Parameters and lim CM sequences: the Q-sequence conjecture and Lech's formula
Mel Hochster, Olivia Strahan