We compute the $\delta$-invariant of a curve singularity parameterized by generic sparse polynomials. We apply this to describe topological types of generic singularities of sparse resultants and ``algebraic knot diagrams'' (i.e. generic algebraic spatial curve projections). Our approach is based on some new results on zero loci of Schur polynomials, on transversality properties of maps defined by sparse polynomials, and on a new refinement of the notion of tropicalization ...

In this paper, we compute the number of self-intersections of a plane projection of a generic complete intersection curve defined by polynomials with the given support. Moreover, we discuss the tropical counterpart of this problem.

We present a Poisson formula for sparse resultants and a formula for the product of the roots of a family of Laurent polynomials, which are valid for arbitrary families of supports. To obtain these formulae, we show that the sparse resultant associated to a family of supports can be identified with the resultant of a suitable multiprojective toric cycle in the sense of Remond. This connection allows to study sparse resultants using multiprojective elimination theory and inter...

We give a complete factorization of the invariant factors of resultant matrices built from birational parameterizations of rational plane curves in terms of the singular points of the curve and their multiplicity graph. This allows us to prove the validity of some conjectures about these invariants stated by Chen, Wang and Liu in [J. Symbolic Comput. 43(2):92-117, 2008]. As a byproduct, we also give a complete factorization of the D-resultant for rational functions in terms o...

We introduce the Macaulay2 package SparseResultants, which provides general tools for computing sparse resultants, sparse discriminants, and hyperdeterminants. We give some background on the theory and briefly show how the package works.

Let ${\cal C}$ be an algebraic space curve defined parametrically by ${\cal P}(t)\in {\Bbb K}(t)^{n},\,n\geq 2$. In this paper, we introduce a polynomial, the T--function, $T(s)$, which is defined by means of a univariate resultant constructed from ${\cal P}(t)$. We show that $T(s)=\prod_{i=1}^n H_{P_i}(s)^{m_i-1}$, where $H_{P_i}(s),\,i=1,\ldots,n$ are polynomials (called the fibre functions) whose roots are the fibre of the ordinary singularities $P_i\in {\cal C}$ of multip...

In nice cases, a zero-dimensional complete intersection ideal over a field of characteristic zero has a Shape Lemma. There are also cases where the ideal is generated by the resultant and first subresultant polynomials of the generators. This paper explores the relation between these representations and studies when the resultant generates the elimination ideal. We also prove a Poisson formula for resultants arising from the hidden variable method.

Given two curves in $\PP^3$, either implicitly or by a parameterization, we want to check if they intersect. For that purpose, we present and further develop generalized resultant techniques. Our aim is to provide a closed formula in the inputs which vanishes if and only if the two curves intersect. This could be useful in Computer Aided Design, for computing the intersection of algebraic surfaces.

In this paper, the discriminant of homogeneous polynomials is studied in two particular cases: a single homogeneous polynomial and a collection of n-1 homogeneous polynomials in n variables. In these two cases, the discriminant is defined over a large class of coefficient rings by means of the resultant. Many formal properties and computational rules are provided and the geometric interpretation of the discriminant is investigated over a general coefficient ring, typically a ...

We have developed in the past several algorithms with intrinsic complexity bounds for the problem of point finding in real algebraic varieties. Our aim here is to give a comprehensive presentation of the geometrical tools which are necessary to prove the correctness and complexity estimates of these algorithms. Our results form also the geometrical main ingredients for the computational treatment of singular hypersurfaces. In particular, we show the non--emptiness of suitab...