Solving systems of nonlinear polynomial equations faster
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Multipolynomial resultant algorithms
Journal of Symbolic Computation
Basic algebraic geometry 1 (2nd, revised and expanded ed.)
Basic algebraic geometry 1 (2nd, revised and expanded ed.)
Basic algebraic geometry 2 (2nd, revised and expanded ed.)
Basic algebraic geometry 2 (2nd, revised and expanded ed.)
Efficient incremental algorithms for the sparse resultant and the mixed volume
Journal of Symbolic Computation
Sparsity considerations in Dixon resultants
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Subresultants under composition
Journal of Symbolic Computation
The structure of sparse resultant matrices
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Groebner basis under composition I
Journal of Symbolic Computation
Solving degenerate sparse polynomial systems faster
Journal of Symbolic Computation - Special issue on polynomial elimination—algorithms and applications
Solving the recognition problem for six lines using the Dixon resultant
Mathematics and Computers in Simulation - Special issue on high performance symbolic computing
Generalized resultants over unirational algebraic varieties
Journal of Symbolic Computation - Special issue on symbolic computation in algebra, analysis and geometry
An Efficient Algorithm for the Sparse Mixed Resultant
AAECC-10 Proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Factoring sparse resultants of linearly combined polynomials
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Sparse Resultant under Vanishing Coefficients
Journal of Algebraic Combinatorics: An International Journal
Dense resultant of composed polynomials mixed-mixed case
Journal of Symbolic Computation
Resultants of skewly composed polynomials
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Rational Univariate Reduction via toric resultants
Journal of Symbolic Computation
Cayley-Dixon projection operator for multi-univariate composed polynomials
Journal of Symbolic Computation
Resultants of partially composed polynomials
Journal of Symbolic Computation
Cayley-Dixon resultant matrices of multi-univariate composed polynomials
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
| Hi-index | 0.00 |
The main question of this paper is: What happens to sparseresultants under composition? More precisely, letf1,…, fnbe homogeneous sparse polynomials in thevariables y1,…, yn andg1,…, gn be homogeneous sparsepolynomials in the variables x1,…,xn.Let fiο(g1,…,gn) bethe sparse homogeneous polynomial obtained from fi byreplacing yj by gj. Naturally a questionarises: Is the sparse resultant off1ο(g1,…,gn),…,fn(g1,…,gn) in any way related tothe (sparse) resultants of f1,…,fn andg1,…,gn? The main contribution of thispaper is to provide an answer for the case wheng1,…,gn are unmixed, namely, Resc1,…,cn (f1 ο(g1,…,gn),…,fnο (g1,…,gn)) =Resd1,…,dn(f1,…,fn)Vol(Q)ResB(g1) where Resd1,…,dn stands for the dense(Macaulay) resultant with respect to the total degreesdi of the fi's, B stands for the unmixedsparse resultant with respect to the support B of thegj's,ResC1,…,Cn stands forthe mixed sparse resultant with respect to the naturally inducedsupports Ci of the fiο(g1,…,gn)'s, and Vol(Q) forthe normalized volume of the Newton polytope of the gj.The above expression can be applied to compute sparse resultants ofcomposed polynomials with improved efficience.