Sylvester’s double sums: An inductive proof of the general case
- 31 August 2012
- journal article
- research article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 47 (8) , 942-953
Abstract
No abstract availableKeywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Modern Computer Algebra2013
- Alon’s Nullstellensatz for multisetsCombinatorica, 2012
- Sylvester double sums and subresultantsJournal of Symbolic Computation, 2011
- Sylvester’s double sums: The general caseJournal of Symbolic Computation, 2009
- An elementary proof of Sylvester’s double sums for subresultantsJournal of Symbolic Computation, 2007
- Double Sylvester sums for subresultants and multi-Schur functionsJournal of Symbolic Computation, 2003
- Algorithms for computer algebra, by Keith O. Geddes, Stephen R. Czapor and George Labahn. Pp 585. £84. 1992. ISBN 0-7923-9259-0 (Kluwer Academic Publishers)The Mathematical Gazette, 1995
- Subresultants and Reduced Polynomial Remainder SequencesJournal of the ACM, 1967
- XVIII. On a theory of the syzygetic relations of two rational integral functions, comprising an application to the theory of Sturm’s functions, and that of the greatest algebraical common measurePhilosophical Transactions of the Royal Society of London, 1853