Rectangular corner cutting and Sylvester A-resultants

Authors:
Ming Zhang;Ron Goldman
Affiliations:
Department of Computer Science, Rice University, Houston, Texas;Department of Computer Science, Rice University, Houston, Texas
Venue:
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Year:
2000

Citing 4
Cited 10

Base points, resultants, and the implicit representation of rational surfaces

Base points, resultants, and the implicit representation of rational surfaces
Matrices in elimination theory

Journal of Symbolic Computation - Special issue on polynomial elimination—algorithms and applications
Rectangular corner cutting and Dixon A -resultants

Journal of Symbolic Computation
Implicitization by Dixon A-Resultants

GMP '00 Proceedings of the Geometric Modeling and Processing 2000

Hybrid sparse resultant matrices for bivariate systems

Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Hybrid sparse resultant matrices for bivariate polynomials

Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
On the efficiency and optimality of Dixon-based resultant methods

Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation

Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
The resultant of an unmixed bivariate system

Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Corner edge cutting and Dixon A-resultant quotients

Journal of Symbolic Computation
Support hull: relating the cayley-dixon resultant constructions to the support of a polynomial system

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Sylvester-resultants for bivariate polynomials with planar newton polygons

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Cayley-Dixon projection operator for multi-univariate composed polynomials

Journal of Symbolic Computation
Cayley-Dixon resultant matrices of multi-univariate composed polynomials

CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present a way to construct the Sylvester A-resultant matrix for three bi-degree (m, n) polynomials whose Newton polygon is modified by cutting off rectangles at the corners. We also show that the determinant of this matrix is generically non-singular, so this determinant is indeed the resultant of the three original bivariate polynomials.