Multihomogeneous resultant formulae by means of complexes

Details Multihomogeneous resultant formulae by means of complexes Multihomogeneous resultant formulae by means of complexes

2003-04-13

arxiv.org/abs/math/0304162v1

Mathematics

Algebraic Geometry

30 pages. To appear: Journal of Symbolic Computation

Scientific paper

We provide conditions and algorithmic tools so as to classify and construct the smallest possible determinantal formulae for multihomogeneous resultants arising from Weyman complexes associated to line bundles in products of projective spaces. We also examine the smallest Sylvester-type matrices, generically of full rank, which yield a multiple of the resultant. We characterize the systems that admit a purely B\'ezout-type matrix and show a bijection of such matrices with the permutations of the variable groups. We conclude with examples showing the hybrid matrices that may be encountered, and illustrations of our Maple implementation. Our approach makes heavy use of the combinatorics of multihomogeneous systems, inspired by and generalizing results by Sturmfels-Zelevinsky, and Weyman-Zelevinsky.

Affiliated with

Also associated with

No associations

Rating

Multihomogeneous resultant formulae by means of complexes 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 by means of complexes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multihomogeneous resultant formulae by means of complexes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-548025