Cayley-Dixon projection operator for multi-univariate composed polynomials
From MaRDI portal
Publication:1023264
DOI10.1016/j.jsc.2008.07.007zbMath1234.68470OpenAlexW2085947630MaRDI QIDQ1023264
Arthur D. Chtcherba, Manfred Minimair, Deepak Kapur
Publication date: 11 June 2009
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2008.07.007
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Computing the Dixon Resultant with the Maple Package DR ⋮ Heuristics to sift extraneous factors in Dixon resultants
Cites Work
- A chain rule for the resultant of two polynomials
- Le formalisme du résultant. (The formalism of resultant)
- Toric intersection theory for affine root counting
- Subresultants under composition
- Sparse resultant under vanishing coefficients
- Dense resultant of composed polynomials: mixed-mixed case
- Corner edge cutting and Dixon \(\mathcal A\)-resultant quotients
- Generalized resultants over unirational algebraic varieties
- Sparse resultant of composed polynomials. I: Mixed-unmixed case.
- Sparse resultant of composed polynomials. II: Unmixed-mixed case.
- Solving degenerate sparse polynomial systems faster
- Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation
- Exact computation of the medial axis of a polyhedron
- Resultants of skewly composed polynomials
- Conditions for exact resultants using the Dixon formulation
- Rectangular corner cutting and Sylvester A-resultants
- A Chain Rule for Multivariable Resultants
- Sur un probl?me de g?om?trie diophantienne lin?aire. I. Poly?dres et r?seaux.
- Rectangular corner cutting and Dixon \({\mathcal A}\)-resultants
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Cayley-Dixon projection operator for multi-univariate composed polynomials
