Multihomogeneous resultant formulae by means of complexes

dc.creatorDickenstein, A.
dc.creatorEmiris, I.
dc.date2003-04-13
dc.date.accessioned2026-07-07T04:56:49Z
dc.date.available2026-07-07T04:56:49Z
dc.descriptionWe 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ézout-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.
dc.description30 pages. To appear: Journal of Symbolic Computation
dc.identifierhttps://arxiv.org/abs/math/0304162
dc.identifierhttp://arxiv.org/abs/math/0304162
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/67060
dc.subjectAlgebraic Geometry
dc.subjectCommutative Algebra
dc.titleMultihomogeneous resultant formulae by means of complexes
dc.typetext

Files

Collections