Computer Science – Symbolic Computation
Scientific paper
2009-04-26
Computer Science
Symbolic Computation
28 pages, 1 table
Scientific paper
Constructive methods for matrices of multihomogeneous (or multigraded) resultants for unmixed systems have been studied by Weyman, Zelevinsky, Sturmfels, Dickenstein and Emiris. We generalize these constructions to mixed systems, whose Newton polytopes are scaled copies of one polytope, thus taking a step towards systems with arbitrary supports. First, we specify matrices whose determinant equals the resultant and characterize the systems that admit such formulae. Bezout-type determinantal formulae do not exist, but we describe all possible Sylvester-type and hybrid formulae. We establish tight bounds for all corresponding degree vectors, and specify domains that will surely contain such vectors; the latter are new even for the unmixed case. Second, we make use of multiplication tables and strong duality theory to specify resultant matrices explicitly, for a general scaled system, thus including unmixed systems. The encountered matrices are classified; these include a new type of Sylvester-type matrix as well as Bezout-type matrices, known as partial Bezoutians. Our public-domain Maple implementation includes efficient storage of complexes in memory, and construction of resultant matrices.
Emiris Ioannis Z.
Mantzaflaris Angelos
No associations
LandOfFree
Multihomogeneous Resultant Formulae for Systems with Scaled Support does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Multihomogeneous Resultant Formulae for Systems with Scaled Support, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multihomogeneous Resultant Formulae for Systems with Scaled Support will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-322179