Sparse resultant of composed polynomials. II: Unmixed-mixed case.

DOI10.1006/jsco.2001.0517zbMath1041.13020OpenAlexW4210476245MaRDI QIDQ1600043

Manfred Minimair

Publication date: 11 June 2002

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.2001.0517

zbMATH Keywords

efficiencycomposed polynomialscomputing sparse resultants

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Polynomials, factorization in commutative rings (13P05)

Related Items (4)

Sparse resultant under vanishing coefficients ⋮ Resultants of partially composed polynomials ⋮ Rational univariate reduction via toric resultants ⋮ Cayley-Dixon projection operator for multi-univariate composed polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Le formalisme du résultant. (The formalism of resultant)
• Multipolynomial resultant algorithms
• Groebner basis under composition. I
• Calculating the Galois group of \(L_1(L_2(y))=0,\) \(L_1, L_2\) completely reducible operators
• Product formulas for resultants and Chow forms
• Subresultants under composition
• Generalized resultants over unirational algebraic varieties
• Solving degenerate sparse polynomial systems faster
• Residues and Resultants
• A Chain Rule for Multivariable Resultants
• A subdivision-based algorithm for the sparse resultant

This page was built for publication: Sparse resultant of composed polynomials. II: Unmixed-mixed case.