Multihomogeneous resultant formulae by means of complexes
From MaRDI portal
Abstract: 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.
Recommendations
Cites work
- Bézout number calculations for multi-homogeneous polynomial systems
- Calculating Discriminants by Higher Direct Images
- Conditions for exact resultants using the Dixon formulation
- Efficient incremental algorithms for the sparse resultant and the mixed volume
- Explicit formulas for the multivariate resultant.
- scientific article; zbMATH DE number 3843889 (Why is no real title available?)
- scientific article; zbMATH DE number 575960 (Why is no real title available?)
- scientific article; zbMATH DE number 708653 (Why is no real title available?)
- scientific article; zbMATH DE number 1736029 (Why is no real title available?)
- scientific article; zbMATH DE number 1487783 (Why is no real title available?)
- scientific article; zbMATH DE number 2151217 (Why is no real title available?)
- scientific article; zbMATH DE number 2151229 (Why is no real title available?)
- scientific article; zbMATH DE number 953014 (Why is no real title available?)
- Ideaux resultants
- Inertia forms and resultant: A formulary
- Matrices in elimination theory
- Multigraded resultants of Sylvester type
- Multivariate polynomials, duality, and structured matrices
- Residues and Resultants
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices
- The maximal number of regular totally mixed Nash equilibria
Cited in
(18)- Syzygies for translational surfaces
- Multilinear polynomial systems: root isolation and bit complexity
- On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs
- Matrix formulæ for resultants and discriminants of bivariate tensor-product polynomials
- Resultants in genetic linkage analysis
- Computing multihomogeneous resultants using straight-line programs
- Rational univariate reduction via toric resultants
- Constructing Sylvester-type resultant matrices using the Dixon formulation
- Solving a sparse system using linear algebra
- Koszul-type determinantal formulas for families of mixed multilinear systems
- Strong \(\mu\)-bases for rational tensor product surfaces and extraneous factors associated to bad base points and anomalies at infinity
- Syzygies and singularities of tensor product surfaces of bidegree (2,1)
- Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants
- The Canny-Emiris conjecture for the sparse resultant
- Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity
- Mixed subdivisions suitable for the greedy Canny-Emiris formula
- Implicitization of 3D rational surfaces using iterated univariate resultants and avoiding extraneous factors
- A matrix-based approach to properness and inversion problems for rational surfaces
This page was built for publication: Multihomogeneous resultant formulae by means of complexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1878475)
