Abstract
Dixon resultant is a basic elimination method which has been used widely in the high technology fields of automatic control, robotics, etc. But how to remove extraneous factors in Dixon resultants has been a very difficult problem. In this paper, we discover some extraneous factors by expressing the Dixon resultant in a linear combination of original polynomial system. Furthermore, it has been proved that the factors mentioned above include three parts which come from Dixon derived polynomials, Dixon matrix and the resulting resultant expression by substituting Dixon derived polynomials respectively.
Similar content being viewed by others
References
Wu W J. Elementary geometry decision problems and mechanical proving (in Chinese). Sci China Ser A-Math, 20(6): 507–516 (1977)
Buchberger B. Grobner bases: An algorithmic method in polynomial ideal theory. In: Multidimensional Systems Theory, Dordrecht: Reidel, 1985, 184–232
Dixon A L. The eliminant of three quantics in two independent variables. Proc London Math Soc, 6: 49–69; (1908)
Kapur D, Saxena T, Yang L. Algebraic and geometric reasoning using Dixon resultants. In: Proceedings of the International Symposium on Symbolic and Algebraic Computation. New York: ACM Press, 1994, 99–107
Zhao S Z, Fu H G. An extended fast algorithm for constructing the Dixon resultant matrix. Sci China Ser A-Math, 48(1): 131–143 (2005)
Lewis R H, Stiller P F. Solving the recognition problem for six lines using the Dixon resultant. Math Comput Simulation, 49(3): 205–219 (1999)
Lewis R H. Using Fermat to solve large polynomial and matrix problems. ACM SIGSAM Bulletin, 38(1): 27–28 (2004)
Lewis R H, Coutsias E A. Algorithmic search for flexibility using resultants of polynomial systems. In: Automated Deduction in Geometry. Berlin: Springer, 2006, 186–191
Zhang J Z, Yang L, Hou X R. A criterion of dependency between algebraic equations and its application in automatic theorem proving (in Chinese). Sci China Ser A-Math, 23(10): 1036–1042 (1993)
Chionh E W. Rectangular corner cutting and Dixon A-resultants. J Symbolic Comput, 31(6): 651–669 (2001)
Foo M, Chinoh E W. Corner point pasting and Dixon A-resultant quotients. In: Proceedings of the 6th Asian Symposium on Computer Mathematics, Beijing, 2003, 114–127
Foo M, Chinoh E W. Corner edge cutting and Dixon A-resultant quotients. J Symbolic Comput, 37(1): 101–119 (2004)
Foo M, Chinoh E W. Dixon A-Resultant quotients for 6-point isosceles triangular corner cutting. In: Geometric Computation. Singapore: World Scientific Publishing, 2004, 374–395
Chtcherba A D, Kapur D. Conditions for exact resultants using the Dixon formulation. In: Proceedings of the International Symposium on Symbolic and Algebraic Computation. New York: ACM Press, 2000, 62–70
Chtcherba A D. A New Sylvester-type Resultant Method based on the Dixon-Bezout Formulation. Dissertation for the Doctoral Degree. Albuquerque: The University of New Mexico, 2003
Chtcherba A D, Kapur D. A complete analysis of resultants and extraneous factors for unmixed bivariate polynomial systems using the Dixon formulation. In: Kredel H, Seiler W K, eds. Proceedings of the 8th Rhine Workshop on Computer Algebra. 2002, 136–166
Chtcherba A D, Kapur D. Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation. J Symbolic Comput, 36(3-4): 289–315 (2003)
Chtcherba A D, Kapur D. Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation. J Symbolic Comput, 38(2): 915–958 (2004)
Xiao W, Chionh E W. Formal power series and loose entry formulas for the Dixon matrix. In: Lecture Notes in Computer Science. Berlin: Springer, 2005, 72–82
Kapur D, Saxena T. Extraneous factors in the Dixon resultant formulation. In: Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation. New York: ACM Press, 1997, 141–148
Yang L, Hou X R. Gather-and-Sift: a symbolic method for solving polynomial systems. In: Proceeding of First Asian Technology Conference in Mathematics. Singapore: World Scientific Publishing, 1995, 771–780
Zhao S Z. Dixon Resultant Research and New Algorithms (in Chinese). Dissertation for the Doctoral Degree. Chengdu: Chengdu Institute of Computer Applications, Chinese Academy of Sciences, 2006
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by the National Key Basic Special Funds of China (Grant No. 2004CB318003), the Knowledge Innovation Project of the Chinese Academy of Sciences (Grant No. KJCX2-YW-S02), the National Natural Science Foundation of China (Grant No. 90718041), Shanghai Leading Academic Discipline Project (Grant No. B412) and the Doctor Startup Foundation of East China Normal University (Grant No. 790013J4)
Rights and permissions
About this article
Cite this article
Zhao, S., Fu, H. Three kinds of extraneous factors in Dixon resultants. Sci. China Ser. A-Math. 52, 160–172 (2009). https://doi.org/10.1007/s11425-008-0094-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11425-008-0094-z