Exact, efficient, and complete arrangement computation for cubic curves
Computational Geometry: Theory and Applications
An elementary proof of Sylvester's double sums for subresultants
Journal of Symbolic Computation
Real implicitization of curves and geometric extraneous components
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Exact, efficient, and complete arrangement computation for cubic curves
Computational Geometry: Theory and Applications
Birational properties of the gap subresultant varieties
Journal of Symbolic Computation
Computer Aided Geometric Design
Hi-index | 0.00 |
This article is devoted to presenting new expressions for Subresultant Polynomials, written in terms of some minors of matrices different from the Sylvester matrix. Moreover, via these expressions, we provide new proofs for formulas which associate the Subresultant polynomials and the roots of the two polynomials. By one hand, we present a new proof for the formula introduced by J. J. Sylvester in 1839, formula written in terms of a single sum over the roots. By other hand, we introduce a new expression in terms of the roots by considering the Newton basis.