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
Sparsity considerations in Dixon resultants
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Extraneous factors in the Dixon resultant formulation
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
The structure of sparse resultant matrices
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic 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
A subdivision-based algorithm for the sparse resultant
Journal of the ACM (JACM)
Generalized resultants over unirational algebraic varieties
Journal of Symbolic Computation - Special issue on symbolic computation in algebra, analysis and geometry
Sparse resultant of composed polynomials I* mixed-unmixed case
Journal of Symbolic Computation
Sparse resultant of composed polynomials II unmixed--mixed case
Journal of Symbolic Computation
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
The resultant of an unmixed bivariate system
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Dense resultant of composed polynomials mixed-mixed case
Journal of Symbolic Computation
Inversion of parameterized hypersurfaces by means of subresultants
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic 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 |
This paper studies resultants of skewly composed polynomials, obtained from n homogeneous polynomials by replacing their variables with n + 1 other homogeneous polynomials, called the inner components. It is shown that the resultant of such composed polynomials is a nested resultant where the inner resultant only depends on the inner components. This work can be considered as a continuation of Jouanolou's and Cheng/McKay/Wang's works on resultants of composed polynomials, who consider non-skewly composed polynomials obtained by composing n homogeneous polynomials with n homogeneous polynomials. Interestingly, in their case the composition structure causes the resultant of composed polynomials to be a power product of resultants, whereas in the current work it is a completely different nested resultant.