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
On the Newton Polytope of the Resultant
Journal of Algebraic Combinatorics: An International Journal
Basic algebraic geometry 1 (2nd, revised and expanded ed.)
Basic algebraic geometry 1 (2nd, revised and expanded ed.)
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
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
Groebner basis under composition I
Journal of Symbolic Computation
Reduced Gro¨bner bases under composition
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
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
Journal of Symbolic Computation
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
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
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 |
This paper is part of the author's work on determining the irreducible factors of sparse (toric) resultants of composed polynomials. The motivation behind this work is to use the factors for efficient elimination of variables, by sparse resultant computation, from composed polynomials. Previous works considered the sparse (toric) resultant of polynomials having arbitrary (mixed) supports composed with (i.e. evaluated at) polynomials having the same (unmixed) supports and of polynomials having the same (unmixed) supports composed with polynomials having arbitrary (mixed) supports, resp. Here, we consider the sparse resultant of linear polynomials having arbitrary (mixed) supports composed with polynomials having arbitrary (mixed) supports, also called "linearly combined polynomials", (under a natural assumption on their exponents). The main contribution of this paper is to determine the irreducible factors, together with their exponents, of the sparse resultant of these linearly combined polynomials. This result essentially generalizes a result by Gelfand, Kapranov and Zelevinsky factoring the sparse resultant of unmixed dense linear polynomials composed with polynomials with unmixed supports. It is expected that this result can be applied to eliminate variables from linearly combined polynomials with improved efficiency.