The Resultant of an Unmixed Bivariate System

2002/09/11 by Amit Khetan, Khetan, Amit · 1 citation
Computer Science · Mathematics · Medicine · #Cancer Treatment and Pharmacology #Matrix Theory and Algorithms #Polynomial and algebraic computation #math.AC #math.AG #math.CO #msc:13P99 #msc:14Q99

paper · pdf · doi:10.48550/arxiv.math/0209115

18 pages, 2 figures

arxiv created 2002/09/11 · arxiv updated 2009/11/30

Abstract

This paper gives an explicit method for computing the resultant of any sparse unmixed bivariate system with given support. We construct square matrices whose determinant is exactly the resultant. The matrices constructed are of hybrid Sylvester and Bézout type. We make use of the exterior algebra techniques of Eisenbud, Fløystad, and Schreyer.

Cited by

• Counting Homogeneous Einstein Metrics

Related

• Multihomogeneous Resultant Formulae for Systems with Scaled Support
• Explicit formulas for the multivariate resultant
• The Canny-Emiris conjecture for the sparse resultant
• Multihomogeneous resultant formulae by means of complexes
• Macaulay Style Formulas for Sparse Resultants