Multigraded Sylvester forms, Duality and Elimination Matrices

04/18/2021
by   Laurent Busé, et al.
0

In this paper we study the equations of the elimination ideal associated with n+1 generic multihomogeneous polynomials defined over a product of projective spaces of dimension n. We first prove a duality property and then make this duality explicit by introducing multigraded Sylvester forms. These results provide a partial generalization of similar properties that are known in the setting of homogeneous polynomial systems defined over a single projective space. As an important consequence, we derive a new family of elimination matrices that can be used for solving zero-dimensional multiprojective polynomial systems by means of linear algebra methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/17/2019

Solving Systems of Linear Inequalities

Dantzig and Eaves claimed that fundamental duality theorems of linear pr...
research
07/17/2019

A Simpler Approach to Linear Programming

Dantzig and Eaves claimed that fundamental duality theorems of linear pr...
research
07/28/2017

Fractions, Projective Representation, Duality, Linear Algebra and Geometry

This contribution describes relationship between fractions, projective r...
research
05/31/2021

Resultant-based Elimination in Ore Algebra

We consider resultant-based methods for elimination of indeterminates of...
research
07/01/2023

Automatic Solver Generator for Systems of Laurent Polynomial Equations

In computer vision applications, the following problem often arises: Giv...
research
05/12/2023

Dimension results for extremal-generic polynomial systems over complete toric varieties

We study polynomial systems with prescribed monomial supports in the Cox...
research
02/24/2019

Factoring Perfect Reconstruction Filter Banks into Causal Lifting Matrices: A Diophantine Approach

The theory of linear Diophantine equations in two unknowns over polynomi...

Please sign up or login with your details

Forgot password? Click here to reset