Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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)
Chionh, E.-W.: Rectangular corner-cutting and Dixon \(\cal A\)-resultants. Journal of Symbolic Computation 31, 651–669 (2001)
Chtcherba, A.D., Kapur, D.: Resultants for unmixed bivariate polynomial systems using the Dixon formulation. Journal of Symbolic Computation 38, 915–958 (2004)
Cox, D., John, L., Donal, O.: Using Algebraic Geometry. Springer, New York (1998)
Dixon, A.L.: The eliminant of three quantics in two independent variables. Proc. London Math. 6, 49–96, 473–492 (1908)
Foo, M.-C.: Dixon \(\cal A\)-resultant formulas. Master thesis, National University of Singapore (2003)
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)
Foo, M.-C., Chionh, E.-W.: Corner edge cutting and Dixon \(\cal A\)-resultant quotients. Journal of Symbolic Computation 37, 101–119 (2004)
Krasauska, R.: Toric surface patches. Advances in Computational Mathematics 17, 89–113 (2002)
Emiris, I.Z., Mourrain, B.: Matrices in elimination theory. Journal of Symbolic Computation 28, 3–44 (1999)
van der Waerden, B.L.: Modern Algebra, ch. XI, vol. II. Ungar Pub. Co., New York (1950)
Xiao, W.: Loose entry formulas and the reduction of Dixon determinant entries. Master thesis, National University of Singapore (2004)
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)
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)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chionh, EW. (2008). The Maximality of the Dixon Matrix on Corner-Cut Monomial Supports. In: Kapur, D. (eds) Computer Mathematics. ASCM 2007. Lecture Notes in Computer Science(), vol 5081. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87827-8_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-87827-8_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87826-1
Online ISBN: 978-3-540-87827-8
eBook Packages: Computer ScienceComputer Science (R0)