In nice cases, a zero-dimensional complete intersection ideal over a field has a Shape
Lemma. There are also cases where the ideal is generated by the resultant and first …

We refine and extend a result by Tuitman on the supports of a B\'ezout identity satisfied by a
finite sequence of sparse Laurent polynomials without common zeroes in the toric variety …

The Canny-Emiris formula [3] gives the sparse resultant as a ratio between the determinant
of a Sylvester-type matrix and a minor of it, by a subdivision algorithm. The most complete …

Solving systems of polynomial equations is a central problem in nonlinear and
computational algebra. Since Buchberger's algorithm for computing Gröbner bases in the …

The Canny-Emiris formula gives the sparse resultant as the ratio of the determinant of a
Sylvester-type matrix over a minor of it, both obtained via a mixed subdivision algorithm. The …

In this paper, we investigate the structure of the saturation of ideals generated by sparse
homogeneous polynomials over a projective toric variety X with respect to the irrelevant …

Alors, modulo une hypothèse 1 sur P, ce quotient Bδ est un A-module de rang 1. Ceci ne
signifie pas qu'il est libre de rang 1, mais que l'on dispose 2 d'une famille finie fidèle s=(sℓ) …

A bstract Algebraic Nahm equations, considered in the paper, are polynomial equations,
governing the q→ 1 limit of the q-hypergeometric Nahm sums. They make an appearance in …

In a seminal article [7], D'Andrea describes a method for determining Macaulay-type
formulae for the resultants of sparse polynomial systems. His algorithm works recursive …

Abstract The Canny–Emiris formula (Canny and Emiris in International symposium on
applied algebra, algebraic algorithms, and error-correcting codes, 1993) gives the sparse …