The Maximality of the Dixon Matrix on Corner-Cut Monomial Supports

  • Eng-Wee Chionh
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5081)


It has been established that the bivariate Dixon matrix persists to be the exact resultant when there are at most two exposed points at each corner of a corner-cut support; but it becomes singular when there are four or more exposed points at any of the corners. For the remaining case of three or fewer exposed points at each of the corners, it is observed that the Dixon matrix is maximal but its determinant is a multiple of the resultant with a priori known bracket powers as the extraneous factors. The maximality of the Dixon matrix for the three-or-fewer exposed points case has been established mechanically for the special situation in which the excess degree is unity when there are three exposed points at a corner. This paper presents a greatly simplified mechanical proof so that its validity can be easily verified.


Dixon matrix corner-cut monomial supports maximality mechanical proof 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Char, B.W., Geddes, K.O., Gonnet, G.H., Leong, B.L., Monogan, M.B., Watt, S.M.: Maple V language reference manual. Springer, New York (1991)zbMATHGoogle Scholar
  2. 2.
    Chionh, E.-W.: Rectangular corner-cutting and Dixon \(\cal A\)-resultants. Journal of Symbolic Computation 31, 651–669 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Chtcherba, A.D., Kapur, D.: Resultants for unmixed bivariate polynomial systems using the Dixon formulation. Journal of Symbolic Computation 38, 915–958 (2004)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Cox, D., John, L., Donal, O.: Using Algebraic Geometry. Springer, New York (1998)zbMATHGoogle Scholar
  5. 5.
    Dixon, A.L.: The eliminant of three quantics in two independent variables. Proc. London Math. 6, 49–96, 473–492 (1908)Google Scholar
  6. 6.
    Foo, M.-C.: Dixon \(\cal A\)-resultant formulas. Master thesis, National University of Singapore (2003)Google Scholar
  7. 7.
    Foo, M.-C., Chionh, E.-W.: Corner point pasting and Dixon \(\cal A\)-resultant quotients. In: Asian Symposium on Computer Mathematics, pp. 114–127 (2003)Google Scholar
  8. 8.
    Foo, M.-C., Chionh, E.-W.: Corner edge cutting and Dixon \(\cal A\)-resultant quotients. Journal of Symbolic Computation 37, 101–119 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Krasauska, R.: Toric surface patches. Advances in Computational Mathematics 17, 89–113 (2002)CrossRefMathSciNetGoogle Scholar
  10. 10.
    Emiris, I.Z., Mourrain, B.: Matrices in elimination theory. Journal of Symbolic Computation 28, 3–44 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    van der Waerden, B.L.: Modern Algebra, ch. XI, vol. II. Ungar Pub. Co., New York (1950)Google Scholar
  12. 12.
    Xiao, W.: Loose entry formulas and the reduction of Dixon determinant entries. Master thesis, National University of Singapore (2004)Google Scholar
  13. 13.
    Xiao, W., Chionh, E.W.: Formal Power Series and Loose Entry Formulas for the Dixon Matrix. In: Computer Algebra and Geometric Algebra with Applications. Springer, Heidelberg (2005)Google Scholar
  14. 14.
    Xiao, W., Chionh, E.W.: Bracket Producing Rows and Columns of the Dixon Determinant. In: Proceedings of the 8th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2006), pp. 164–170. IEEE, Los Alamitos (2006)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Eng-Wee Chionh
    • 1
  1. 1.School of ComputingNational University of SingaporeLaw LinkSingapore

Personalised recommendations