Singular loci of sparse resultants

This paper focuses on the equidimensional decomposition of affine varieties defined by sparse polynomial systems. For generic systems with fixed supports, we give combinatorial conditions for the existence of positive dimensional components which characterize the equidimensional decomposition of the associated affine variety. This result is applied to design an equidimensional decomposition algorithm for generic sparse systems. For arbitrary sparse systems of n polynomials in...

In this paper we derive an upper bound for the degree of the strict invariant algebraic curve of a polynomial system in the complex project plane under generic condition. The results are obtained through the algebraic multiplicities of the system at the singular points. A method for computing the algebraic multiplicity using Newton polygon is also presented.

The development of computational techniques in the last decade has made possible to attack some classical problems of algebraic geometry. In this survey, we briefly describe some open problems related to algebraic curves which can be approached from a computational viewpoint.

Let $\Lambda$ be a numerical semigroup, $\mathcal{C}\subseteq \mathbb{A}^n$ the monomial curve singularity associated to $\Lambda$, and $\mathcal{T}$ its tangent cone. In this paper we provide a sharp upper bound for the least positive integer in $\Lambda$ in terms of the codimension and the maximum degree of the equations of $\mathcal{T}$, when $\mathcal{T}$ is not a complete intersection. A special case of this result settles a question of J. Herzog and D. Stamate.

We describe the roots of the Bernstein-Sato polynomial of a monomial ideal using reduction mod p and invariants of singularities in positive chracteristic. We give in this setting a positive answer to a problem of Takagi, Watanabe and the second author, concerning the dependence on the characteristic for these invariants of singularities.

In this survey, we examine the properties of the top dimensional singular set $\text{sing}_{*}(u)$, including several theorems, geometric properties, and relation to homogeneous degree zero minimizers.

Polynomial system solving arises in many application areas to model non-linear geometric properties. In such settings, polynomial systems may come with degeneration which the end-user wants to exclude from the solution set. The nondegenerate locus of a polynomial system is the set of points where the codimension of the solution set matches the number of equations. Computing the nondegenerate locus is classically done through ideal-theoretic operations in commutative algebra s...

Polar varieties have in recent years been used by Bank, Giusti, Heintz, Mbakop, and Pardo, and by Safey El Din and Schost, to find efficient procedures for determining points on all real components of a given non-singular algebraic variety. In this note we review the classical notion of polars and polar varieties, as well as the construction of what we here call reciprocal polar varieties. In particular we consider the case of real affine plane curves, and we give conditions ...

We present a product formula for the initial parts of the sparse resultant associated to an arbitrary family of supports, generalising a previous result by Sturmfels. This allows to compute the homogeneities and degrees of the sparse resultant, and its evaluation at systems of Laurent polynomials with smaller supports. We obtain a similar product formula for some of the initial parts of the principal minors of the Sylvester-type square matrix associated to a mixed subdivision...

We compute the resultants for quadratic binomial complete intersections. As an application we show that any quadratic binomial complete intersection can have the set of square-free monomials as a vector space basis if the generators are put in a normal form.