Related papers: Plane mixed discriminants and toric jacobians
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, 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 discriminant of a polynomial map is central to problems from affine geometry and singularity theory. Standard methods for characterizing it rely on elimination techniques that can often be ineffective. This paper concerns polynomial…
We consider systems of Laurent polynomials with support on a fixed point configuration. In the non-defective case, the closure of the locus of coefficients giving a non-degenerate multiple root of the system is defined by a polynomial…
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…
The range of a trigonometric polynomial with complex coefficients can be interpreted as the image of the unit circle under a Laurent polynomial. We show that this range is contained in a real algebraic subset of the complex plane. Although…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
We consider the Alexander polynomial of a plane algebraic curve twisted by a linear representation. We show that it divides the product of the polynomials of the singularity links, for unitary representations. Moreover, their quotient is…
We study normal directions to facets of the Newton polytope of the discriminant of the Laurent polynomial system via the tropical approach. We use the combinatorial construction proposed by Dickenstein, Feichtner and Sturmfels for the…
An observation by J-P. Serre implies that cubic polynomials are unique among generic monic polynomials of degree 2 or higher in that they have a root that is a power series in the discriminant of the polynomial. We provide formulas for this…
This paper reexamines univariate reduction from a toric geometric point of view. We begin by constructing a binomial variant of the $u$-resultant and then retailor the generalized characteristic polynomial to fully exploit sparsity in the…
In this paper we propose a conseptual framework for the observed properties of discriminants of polylinear forms. The connection with classical problems of linear algebra is shown. A new class of algebraic varieties (hypergrassmanians) is…
Finding a common factor of two multivariate polynomials with approximate coefficients is a problem in symbolic-numeric computing. Taking a tropical view on this problem leads to efficient preprocessing techniques, applying polyhedral…
The entropic discriminant is a non-negative polynomial associated to a matrix. It arises in contexts ranging from statistics and linear programming to singularity theory and algebraic geometry. It describes the complex branch locus of the…
A fundamental problem in computational algebraic geometry is the computation of the resultant. A central question is when and how to compute it as the determinant of a matrix. whose elements are the coefficients of the input polynomials…
An important invariant of a polynomial $f$ is its Jacobian algebra defined by its partial derivatives. Let $f$ be invariant with respect to the action of a finite group of diagonal symmetries $G$. We axiomatically define an orbifold…
We present a new, far simpler family of counter-examples to Kushnirenko's Conjecture. Along the way, we illustrate a computer-assisted approach to finding sparse polynomial systems with maximally many real roots, thus shedding light on the…
The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…
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…
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…