Dense resultant of composed polynomials: mixed-mixed case

DOI10.1016/S0747-7171(03)00039-7zbMath1053.13002OpenAlexW1576119938MaRDI QIDQ1432880

Manfred Minimair

Publication date: 22 June 2004

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

Full work available at URL: https://doi.org/10.1016/s0747-7171(03)00039-7

Mathematics Subject Classification ID

Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Computational aspects and applications of commutative rings (13P99) Polynomials over commutative rings (13B25)

Related Items (3)

Multipliers and invariants of endomorphisms of projective space in dimension greater than 1 ⋮ Resultants of partially composed polynomials ⋮ Cayley-Dixon projection operator for multi-univariate composed polynomials

Cites Work

• 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
• Sparse resultant of composed polynomials. I: Mixed-unmixed case.
• Solving degenerate sparse polynomial systems faster
• Residues and Resultants
• A Chain Rule for Multivariable Resultants
• A subdivision-based algorithm for the sparse resultant
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Dense resultant of composed polynomials: mixed-mixed case