Sparse resultant of composed polynomials. I: Mixed-unmixed case.
From MaRDI portal
Publication:1600042
DOI10.1006/jsco.2001.0516zbMath1041.13019OpenAlexW2071679970MaRDI QIDQ1600042
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.0516
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
Sparse resultant under vanishing coefficients, Dense resultant of composed polynomials: mixed-mixed case, Resultants of partially composed polynomials, Rational univariate reduction via toric resultants, Cayley-Dixon projection operator for multi-univariate composed polynomials, Hyperdeterminants from the \(E_8\) discriminant
Cites Work
- Le formalisme du résultant. (The formalism of resultant)
- Multipolynomial resultant algorithms
- Groebner basis under composition. I
- Toric intersection theory for affine root counting
- 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
- Efficient incremental algorithms for the sparse resultant and the mixed volume
- Introduction to Toric Varieties. (AM-131)
- Residues and Resultants
- A Chain Rule for Multivariable Resultants
- Sur un probl?me de g?om?trie diophantienne lin?aire. I. Poly?dres et r?seaux.
- Explicit formulas for the multivariate resultant.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
