Singular loci of sparse resultants

Given any polynomial system with fixed monomial term structure, we give explicit formulae for the generic number of roots with specified coordinate vanishing restrictions. For the case of affine space minus an arbitrary union of coordinate hyperplanes, these formulae are also the tightest possible upper bounds on the number of isolated roots. We also characterize, in terms of sparse resultants, precisely when these upper bounds are attained. Finally, we reformulate and extend...

Resultants and Gr\"obner bases are crucial tools in studying polynomial elimination theory. We investigate relations between the variety of the resultant of two polynomials and the variety of the ideal they generate. Then we focus on the bivariate case, in which the elimination ideal is principal. We study - by means of elementary tools - the difference between the multiplicity of the factors of the generator of the elimination ideal and the multiplicity of the factors of the...

Solving systems of polynomial equations is a central problem in nonlinear and computational algebra. Since Buchberger's algorithm for computing Gr\"obner bases in the 60s, there has been a lot of progress in this domain. Moreover, these equations have been employed to model and solve problems from diverse disciplines such as biology, cryptography, and robotics. Currently, we have a good understanding of how to solve generic systems from a theoretical and algorithmic point of ...

In this paper, we develop a new approach to the discrimi-nant of a complete intersection curve in the 3-dimensional projective space. By relying on the resultant theory, we first prove a new formula that allows us to define this discrimi-nant without ambiguity and over any commutative ring, in particular in any characteristic. This formula also provides a new method for evaluating and computing this discrimi-nant efficiently, without the need to introduce new variables as wit...

We correct a mistake in an earlier paper and give a complete classification of singular varieties having an extremal secant line.

We introduce the notion of resultant of two planar curves in the tropical geometry framework. We prove that the tropicalization of the algebraic resultant can be used to compute the stable intersection of two tropical plane curves. It is shown that, for two generic preimages of the curves to an algebraic framework, their intersection projects exactly onto the stable intersection of the curves. It is also given sufficient conditions for such a generality in terms of the residu...

The computation of the topology of a real algebraic plane curve is greatly simplified if there are no more than one critical point in each vertical line: the general position condition. When this condition is not satisfied, then a finite number of changes of coordinates will move the initial curve to one in general position. We will show many cases where the topology of the considered curve around a critical point is very easy to compute even if the curve is not in general po...

Sparse (or toric) elimination exploits the structure of polynomials by measuring their complexity in terms of Newton polytopes instead of total degree. The sparse, or Newton, resultant generalizes the classical homogeneous resultant and its degree is a function of the mixed volumes of the Newton polytopes. We sketch the sparse resultant constructions of Canny and Emiris and show how they reduce the problem of root-finding to an eigenproblem. A novel method for achieving this ...

Let $S_0$ be a smooth and compact real variety given by a reduced regular sequence of polynomials $f_1, ..., f_p$. This paper is devoted to the algorithmic problem of finding {\em efficiently} a representative point for each connected component of $S_0$ . For this purpose we exhibit explicit polynomial equations that describe the generic polar varieties of $S_0$. This leads to a procedure which solves our algorithmic problem in time that is polynomial in the (extrinsic) descr...

There are two well known tasks, related to Newton polyhedra: to study invariants of singularities in terms of their Newton polyhedra, and to describe Newton polyhedra of resultants and discriminants. We introduce so called resultantal singularities, whose study in terms of Newton polyhedra unifies these two tasks to a certain extent. As an application, we study topological invariants of determinantal singularities and (co)vector fields on singular varieties in terms of Newton...