Related papers: Duality of Multiple Root Loci

We describe the algebraic boundaries of the regions of real binary forms with fixed typical rank and of degree at most eight, showing that they are dual varieties of suitable coincident root loci.

We state the relation between the variety of binary forms of given rank and the dual of the multiple root loci. This is a new result for the suprageneric rank, as a continuation of the work by Buczy\'nski, Han, Mella and Teitler. We…

Coincident root loci are subvarieties of $S^d(C^2)$--the space of binary forms of degree $d$--labelled by partitions of $d$. Given a partition $\lambda$, let $X_\lambda$ be the set of forms with root multiplicity corresponding to $\lambda$.…

We bound the location of roots of polynomials that have nonnegative coefficients with respect to a fixed but arbitrary basis of the vector space of polynomials of degree at most $d$. For this, we interpret the basis polynomials as vector…

We study the problem of specifying algebraic conditions on the coefficients of a binary form, so that it may have roots with preassigned multiplicities.

This paper investigates the stratification of the discriminant hypersurface associated with a univariate polynomial via the number of its distinct complex roots. We introduce two novel approaches different from the one based on…

We seek complex roots of a univariate polynomial $P$ with real or complex coefficients. We address this problem based on recent algorithms that use subdivision and have a nearly optimal complexity. They are particularly efficient when only…

For certain polynomials we relate the number of roots inside the unit circle with the index of a non-degenerate isolated umbilic point on a real analytic surface in Euclidean 3-space. In particular, for $N>0$ we prove that for a certain…

We give a new method to calculate the universal cohomology classes of coincident root loci. We show a polynomial behavior of them and apply this result to prove that generalized Pl\"ucker formulas are polynomials in the degree, just as the…

We present a new topological method to study the discriminantal loci of an algebraic variety defined in a product of projective spaces. Our approach relies on an efficient use of groupoid to describe the monodromy. As an example, we treat…

We discuss the problem of optimizing the distance function from a given point, subject to polynomial constraints. A key algebraic invariant that governs its complexity is the Euclidean distance degree, which pertains to first-order…

In these notes we study hyperplane arrangements having at least one logarithmic derivation of degree two that is not a combination of degree one logarithmic derivations. It is well-known that if a hyperplane arrangement has a linear…

We show that the algebraic boundaries of the regions of real binary forms with fixed typical rank are always unions of dual varieties to suitable coincident root loci.

In this note we introduce higher order polar loci as natural generalizations of the classical polar loci, replacing the role of tangent spaces by that of higher order osculating spaces. The close connection between polar loci and dual…

We conjecture that the roots of a degree-n univariate complex polynomial are located in a union of n-1 annuli, each of which is centered at a root of the derivative and whose radii depend on higher derivatives. We prove the conjecture for…

We study polynomial iterative roots of polynomials and describe the locus of complex polynomials of degree 4 admitting a polynomial iterative square root.

Double ramification loci parametrise marked curves where a weighted sum of the markings is linearly trivial; higher-rank loci are obtained by imposing several such conditions simultaneously. We obtain closed formulae for the orbifold Euler…

We introduce a theory of relative tangency for projective algebraic varieties. The dual variety $X_Z^\vee$ of a variety $X$ relative to a subvariety $Z$ is the set of hyperplanes tangent to $X$ at a point of $Z$. We also introduce the…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

We determine the extreme points and facets of the convex hull of all dual degree partitions of simple graphs on $n$ vertices.