Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation
From MaRDI portal
Publication:2643546
DOI10.1016/j.jsc.2003.12.001zbMath1137.13319OpenAlexW2061296216MaRDI QIDQ2643546
Arthur D. Chtcherba, Deepak Kapur
Publication date: 24 August 2007
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2003.12.001
Symbolic computation and algebraic computation (68W30) Computational aspects and applications of commutative rings (13P99) Basic linear algebra (15A99)
Related Items (8)
Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation ⋮ Constructing Sylvester-type resultant matrices using the Dixon formulation ⋮ Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation ⋮ 0/0 simplifies implicitization ⋮ The Maximality of the Dixon Matrix on Corner-Cut Monomial Supports ⋮ Matrix formulæ for resultants and discriminants of bivariate tensor-product polynomials ⋮ Three kinds of extraneous factors in Dixon resultants ⋮ Heuristics to sift extraneous factors in Dixon resultants
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hybrid sparse resultant matrices for bivariate polynomials
- Product formulas for resultants and Chow forms
- Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation
- The resultant of an unmixed bivariate system
- On the geometry of parametrized bicubic surfaces
- Constructing Sylvester-type resultant matrices using the Dixon formulation
- Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation
- Macaulay style formulas for sparse resultants
- Hybrid sparse resultant matrices for bivariate systems
- Conditions for exact resultants using the Dixon formulation
- Rectangular corner cutting and Sylvester A-resultants
- Residues and Resultants
- A subdivision-based algorithm for the sparse resultant
- An implicitization algorithm for rational surfaces with no base points
- Rectangular corner cutting and Dixon \({\mathcal A}\)-resultants
This page was built for publication: Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation