Corner edge cutting and Dixon \(\mathcal A\)-resultant quotients
From MaRDI portal
Publication:1432892
DOI10.1016/j.jsc.2003.06.001zbMath1081.68122OpenAlexW2062429253MaRDI QIDQ1432892
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/j.jsc.2003.06.001
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
Complexity of constructing Dixon resultant matrix ⋮ Differential elimination with Dixon resultants ⋮ 0/0 simplifies implicitization ⋮ The Maximality of the Dixon Matrix on Corner-Cut Monomial Supports ⋮ Cayley-Dixon projection operator for multi-univariate composed polynomials ⋮ Three kinds of extraneous factors in Dixon resultants ⋮ Heuristics to sift extraneous factors in Dixon resultants
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Chow polytopes and general resultants
- Concise parallel Dixon determinant
- Toric surface patches
- Fast computation of the Bézout and Dixon resultant matrices
- The \(n\)-sided toric patches and \(\mathcal A\)-resultants
- Matrices in elimination theory
- On the Bézout construction of the resultant
- Rectangular corner cutting and Sylvester A-resultants
- Rectangular corner cutting and Dixon \({\mathcal A}\)-resultants
This page was built for publication: Corner edge cutting and Dixon \(\mathcal A\)-resultant quotients