Related papers: Iterated and mixed discriminants
Polynomial algebra offers a standard approach to handle several problems in geometric modeling. A key tool is the discriminant of a univariate polynomial, or of a well-constrained system of polynomial equations, which expresses the…
The mixed discriminant of n Laurent polynomials in n variables is the irreducible polynomial in the coefficients which vanishes whenever two of the roots coincide. The Cayley trick expresses the mixed discriminant as an A-discriminant. We…
In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into…
The discriminant of a multivariate polynomial with indeterminate coefficients is not necessarily a hypersurface, and characterizing its codimension was an open problem for quite a while. We resolve this problem for the discriminants of…
We consider the problem of complex root classification, i.e., finding the conditions on the coefficients of a univariate polynomial for all possible multiplicity structures on its complex roots. It is well known that such conditions can be…
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 propose a method for constructing systems of polynomial equations that define submanifolds of degenerate binary forms of an arbitrary degeneracy degree. It is appropriate to call these systems of equations "higher discriminants".
We study a general class of bilevel problems, consisting in the minimization of an upper-level objective which depends on the solution to a parametric fixed-point equation. Important instances arising in machine learning include…
In this paper, we consider the problem of representing a multivariate polynomial as the determinant of a definite (monic) symmetric/Hermitian linear matrix polynomial (LMP). Such a polynomial is known as determinantal polynomial.…
The hyperdeterminant of a polynomial (interpreted as a symmetric tensor) factors into several irreducible factors with multiplicities. Using geometric techniques these factors are identified along with their degrees and their…
In this work we establish a connection between copositivity, that is, nonnegativity on the positive orthant, of sparse real Laurent polynomials and discriminants. Specifically, we consider Laurent polynomials in the positive orthant with…
This paper deals with properties of the algebraic variety defined as the set of zeros of a "typical" sequence of polynomials. We consider various types of "nice" varieties: set-theoretic and ideal-theoretic complete intersections,…
Let $X$ be a smooth irreducible quasi-projective algebraic variety over a number field $K$. Suppose $X$ is equipped with a $p$-adic \'{e}tale local system compatible with an admissible graded-polarized variation of mixed Hodge structures on…
Let $\mathcal D_{d,k}$ denote the discriminant variety of degree $d$ polynomials in one variable with at least one of its roots being of multiplicity $\geq k$. We prove that the tangent cones to $\mathcal D_{d,k}$ span $\mathcal D_{d,k-1}$…
In this paper, we study the relationship between iterated resultant and multivariate discriminant. We show that, for generic form $f(X_n)$ with even degree $d$, if the polynomial is squarefreed after each iteration, the multivariate…
Suppose X is the complex zero set of a finite collection of polynomials in Z[x_1,...,x_n]. We show that deciding whether X contains a point all of whose coordinates are d_th roots of unity can be done within NP^NP (relative to the sparse…
The characteristic polynomial of an $r$-tuple $(A_1,..., A_r)$ of $n \times n$ matrices is the determinant $\det(x_0 I + x_1 A_1 + ... + x_r A_r)$. We show that if $r$ is at least 3 and $A = (A_1,..., A_r)$ is an $r$-tuple of matrices in…
In this paper, we choose the derivative polynomials for tangent and secant as basis sets of polynomial space. From this viewpoint, we first give an expansion of the derivative polynomials for tangent in terms of the derivative polynomials…
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…
Let $A$ be an integral matrix and let $P$ be the convex hull of its columns. By a result of Gelfand, Kapranov and Zelevinski, the so-called principal $A$-determinant locus is equal to the union of the closures of the discriminant loci of…