The Maximality of the Dixon Matrix on Corner-Cut Monomial Supports
- 1k Downloads
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.
KeywordsDixon matrix corner-cut monomial supports maximality mechanical proof
Unable to display preview. Download preview PDF.
- 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.Foo, M.-C.: Dixon \(\cal A\)-resultant formulas. Master thesis, National University of Singapore (2003)Google Scholar
- 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
- 11.van der Waerden, B.L.: Modern Algebra, ch. XI, vol. II. Ungar Pub. Co., New York (1950)Google Scholar
- 12.Xiao, W.: Loose entry formulas and the reduction of Dixon determinant entries. Master thesis, National University of Singapore (2004)Google Scholar
- 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