Rectangular corner cutting and Dixon \({\mathcal A}\)-resultants

DOI10.1006/jsco.2001.0448zbMath0987.65044OpenAlexW2012493593MaRDI QIDQ5937883

No author found.

Publication date: 18 July 2001

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.2001.0448

zbMATH Keywords

systems of polynomial equations\({\mathcal A}\)-resultantDixon coefficient matrixDixon polynomialsDixon resultantMacaulay quotientrectangular corner cutting

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Real polynomials: location of zeros (26C10)

Related Items

Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation, The resultant of an unmixed bivariate system, Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation, Corner edge cutting and Dixon \(\mathcal A\)-resultant quotients, 0/0 simplifies implicitization, Representing rational curve segments and surface patches using semi-algebraic sets, 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chow polytopes and general resultants
• The \(n\)-sided toric patches and \(\mathcal A\)-resultants
• Matrices in elimination theory
• On the Bézout construction of the resultant
• Conditions for exact resultants using the Dixon formulation