Elsevier

Journal of Symbolic Computation

Volume 36, Issues 3–4, September–October 2003, Pages 289-315
Journal of Symbolic Computation

Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation

https://doi.org/10.1016/S0747-7171(03)00084-1Get rights and content
Under an Elsevier user license
open archive

Abstract

Structural conditions on the support of a multivariate polynomial system are developed for which the Dixon-based resultant methods compute exact resultants. The concepts of a corner-cut support and almost corner-cut support of an unmixed polynomial system are introduced. For generic unmixed polynomial systems with corner-cut and almost corner-cut supports, the Dixon based methods can be used to compute their resultants exactly. These structural conditions on supports are based on analyzing how such supports differ from box supports of d-degree systems for which the Dixon formulation is known to compute resultants exactly. Such an analysis also gives a sharper bound on the complexity of resultant computation using the Dixon formulation in terms of the support and the mixed volume of the Newton polytope of the support.

These results are a direct generalization of the authors’ results on bivariate systems including the results of Zhang and Goldman as well as of Chionh for generic unmixed bivariate polynomial systems with corner-cut supports.

Keywords

Resultant
Dixon method
Extraneous factor
BKK bound
Support
Support hull

Cited by (0)