Multigraded Sylvester forms, duality and elimination matrices (Q2168825)

In symbolic computation and algebraic geometry, elimination theory is crucial to solve polynomial systems. This paper introduces the equations of the elimination ideal associated with generic multihomogeneous polynomials defined over a product of projective spaces and new elimination tools that can be used for solving zero-dimensional multiprojective polynomial systems by means of linear algebra methods. Recall that a homogeneous polynomial is said to be multihomogeneous if the set of variables can be partitioned into subsets so that the polynomial is homogeneous when considered as a polynomial in each subset. In order to make the paper self-contained, the authors review the main algebraic aspects on elimination matrices associated with zero-dimensional polynomial systems defined by \(n + 1\) equations over a single projective \(\mathbb{P}_\mathbb{K}^n\) and they generalize such results to the multigraded case, providing structural results on the corresponding saturated ideal and compact elimination matrices built from non trivial inertia forms and having the drop-of-rank property.