An elementary proof of Sylvester's double sums for subresultants
From MaRDI portal
Publication:2457422
DOI10.1016/j.jsc.2006.09.003zbMath1211.13021arXivmath/0604418OpenAlexW2054272528MaRDI QIDQ2457422
Teresa Krick, Hoon Hong, Carlos D'Andrea, Agnes Szanto
Publication date: 23 October 2007
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0604418
Symbolic computation and algebraic computation (68W30) Computational aspects and applications of commutative rings (13P99) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)
Related Items
Subresultants in multiple roots: an extremal case, Subresultants in multiple roots, Sylvester's double sums: an inductive proof of the general case, Sylvester double sums and subresultants, Subresultants, Sylvester sums and the rational interpolation problem, A condition for multiplicity structure of univariate polynomials, Closed formula for univariate subresultants in multiple roots, Sylvester double sums, subresultants and symmetric multivariate Hermite interpolation, Symmetric interpolation, Exchange Lemma and Sylvester sums, Sylvester's double sums: the general case
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multivariate subresultants in roots
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- Double Sylvester sums for subresultants and multi-Schur functions.
- New structure theorem for subresultants
- Various new expressions for subresultants and their applications
- Subresultants and Reduced Polynomial Remainder Sequences
- On Euclid's Algorithm and the Theory of Subresultants
- Ore subresultant coefficients in solutions