ABSTRACT
A geometric concept of the support hull of the support of a polynomial was used earlier by the authors for developing a tight upper bound on the size of the Cayley-Dixon resultant matrix for an unmixed polynomial system. The relationship between the support hull and the Cayley-Dixon resultant construction is analyzed in this paper. The support hull is shown to play an important role in the construction and analysis of resultant matrices based on the Cayley-Dixon formulation, similar to the role played by the associated convex hull (Newton polytope) for analyzing resultant matrices over the toric variety. For an unmixed polynomial system, the sizes of the resultant matrices (both dialytic as well as nondialytic) constructed using the Cayley-Dixon formulation are determined by the support hull of its support. Consequently, degree of the projection operator (which is in general, a nontrivial multiple of the resultant) computed from such a resultant matrix is determined by the support hull.The support hull of a given support is similar to its convex hull except that instead of the Euclidean distance, the support hull is defined using rectilinear distance. The concept of a support-hull interior point is introduced. It is proved that for an unmixed polynomial system, the size of the resultant matrix (both dialytic and nondialytic) based on the Cayley-Dixon formulation remains the same even if a term whose exponent is support-hull interior with respect to the support is generically added to the polynomial system. This key insight turned out to be instrumental in generalizing the concept of an unmixed polynomial system with a corner-cut support from 2 dimensions to arbitrary dimension as well as identifying an unmixed polynomial system with almost corner-cut support in arbitrary dimension.An algorithm for computing the size (and the lattice points) of the support hull of a given support is presented. It is proved that determining whether a given lattice point is not in the support hull, is NP-complete. A heuristic for computing a good variable ordering for constructing Dixon matrices for mixed as well as unmixed polynomial systems is proposed using the support hull and its projections. This is one of the first results on developing heuristics for variable orderings for constructing resultant matrices. A construction for a Sylvester-type resultant matrix based on the support hull of a polynomial system is also given.
- D. Avis, D. Bremner, and R. Seidel. How good are convex hull algorithms. Computational Geometry: Theory and Applications, 7:265--302, 1997. Google ScholarDigital Library
- J. Canny and I. Emiris. A subdivision based algorithm for the sparse resultant. J. ACM, 2000. Google ScholarDigital Library
- E.-W. Chionh. Rectangular corner cutting and dixon A-resultants. Journal of Symbolic Computation, 31:651--663, 2001. Google ScholarDigital Library
- A. D. Chtcherba. A new Sylvester-type Resultant Method based on the Dixon- Bézout Formulation. PhD thesis, Department of Computer Science, University of New Mexico, Albuquerque, NM 87131, USA, Jul 2003. Google ScholarDigital Library
- A. D. Chtcherba and D. Kapur. Conditions for Exact Resultants using the Dixon formulation. ISSAC00, pages 62--70, 2000. Google ScholarDigital Library
- A. D. Chtcherba and D. Kapur. Constructing Sylvester-type Resultant Matrices using the Dixon Formulation. Accepted for publication Journal of Symbolic Computation, 2003.Google Scholar
- A. D. Chtcherba and D. Kapur. Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation. Journal of Symbolic Computation, 36(3--4):289--315, 2003. Google ScholarDigital Library
- A. D. Chtcherba and D. Kapur. Resultants for Unmixed Bivariate Polynomial Systems using the Dixon formulation. Accepted for publication in JSC, Dec. 2003. Google ScholarDigital Library
- A. D. Chtcherba and D. Kapur. On Relationship between the Dixon-based Resultant Construction and the Supports of Polynomial Systems. Technical Report Forthcomming, Computer Science Dept., Univ. of New Mexico, Albuquerque, New Mexico, USA, 2004.Google Scholar
- A. Dixon. The eliminant of three quantics in two independent variables. Proc. London Mathematical Society, 6:468--478, 1908.Google ScholarCross Ref
- I. Emiris and J. Canny. Efficient incremental algorithms for the sparse resultant and the mixed volume. J. Symbolic Computation, 20(2):117--149, August 1995. Google ScholarDigital Library
- D. Kapur and T. Saxena. Comparison of various multivariate resultants. In ACM ISSAC 95, Montreal, Canada, July 1995. Google ScholarDigital Library
- D. Kapur and T. Saxena. Sparsity considerations in the Dixon resultant formulation. In Proc. ACM Symposium on Theory of Computing, Philadelphia, May 1996. Google ScholarDigital Library
- D. Kapur, T. Saxena, and L. Yang. Algebraic and geometric reasoning using the Dixon resultants. In ACM ISSAC 94, pages 99--107, Oxford, England, July 1994. Google ScholarDigital Library
- I. Shafarevich. Basic Algebraic Geometry. Spring-Verlag, New-York, second edition, 1994. Google ScholarDigital Library
- M. Zhang and R. Goldman. Rectangular Corner Cutting and Sylvester A-Resultants. In C. Traverso, editor, Proc. of the ISSAC, pages 301--308, St. Andrews, Scotland, Aug. 2000. ACM Press. Google ScholarDigital Library
Index Terms
- Support hull: relating the cayley-dixon resultant constructions to the support of a polynomial system
Recommendations
Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation
Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)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 ...
On the efficiency and optimality of Dixon-based resultant methods
ISSAC '02: Proceedings of the 2002 international symposium on Symbolic and algebraic computationStructural conditions on polynomial systems are developed for which the Dixon-based resultant methods often compute exact resultants. For cases when this cannot be done, the degree of the extraneous factor in the projection operator computed using the ...
On the resultant of degree-deficient polynomials
ISTASC'07: Proceedings of the 7th Conference on 7th WSEAS International Conference on Systems Theory and Scientific Computation - Volume 7The resultant is an algebraic expression, computable in a finite number of arithmetic operations from the coefficients of two univariate polynomials, that vanishes if, and only if, the two polynomials have common zeros. The paper considers formal ...
Comments