Related papers: Computing Hermitian determinantal representations …
If a real symmetric matrix of linear forms is positive definite at some point, then its determinant is a hyperbolic hypersurface. In 2007, Helton and Vinnikov proved a converse in three variables, namely that every hyperbolic plane curve…
We consider the problem of writing real polynomials as determinants of symmetric linear matrix polynomials. This problem of algebraic geometry, whose roots go back to the nineteenth century, has recently received new attention from the…
A smooth curve in the real projective plane is hyperbolic if its ovals are maximally nested. By the Helton-Vinnikov Theorem, any such curve admits a definite symmetric determinantal representation. We use polynomial homotopy continuation to…
Hyperbolic homogeneous polynomials with real coefficients, i.e., hyperbolic real projective hypersurfaces, and their determinantal representations, play a key role in the emerging field of convex algebraic geometry. In this paper we…
We give a new and completely algebraic proof of the Helton-Vinnikov Theorem stating that every hyperbolic polynomial in three variables admits a definite linear determinantal representation.
We study hyperbolic polynomials with nice symmetry and express them as the determinant of a Hermitian matrix with special structure. The goal of this paper is to answer a question posed by Chien and Nakazato in 2015. By properly modifying a…
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.…
Hyperbolic programming is the problem of computing the infimum of a linear function when restricted to the hyperbolicity cone of a hyperbolic polynomial, a generalization of semidefinite programming. We propose an approach based on symbolic…
We prove a generalization of the Hermitian version of the Helton-Vinnikov determinantal representation of hyperbolic polynomials to the class of semi-hyperbolic polynomials, a strictly larger class, as shown by an example. We also prove…
A (global) determinantal representation of hypersurface in P^n is a matrix, whose entries are linear forms in homogeneous coordinates and whose determinant defines the hypersurface. We study the properties of such representations for…
We show that for every smooth hyperbolic polynomial h there is another hyperbolic polynomial q such that qh has a definite determinantal representation. This is proved by considering sum-of-squares decompositions of certain bilinear forms…
We give a brief report on our computations of linear determinantal representations of smooth plane cubics over finite fields. After recalling a classical interpretation of linear determinantal representations as rational points on the…
In this paper we explore determinantal representations of multiaffine polynomials and consequences for the image of various spaces of matrices under the principal minor map. We show that a real multiaffine polynomial has a definite…
Here we study the space of real hyperbolic plane curves that are invariant under actions of the cyclic and dihedral groups and show they have determinantal representations that certify this invariance. We show an analogue of Nuij's theorem…
Helton and Vinnikov showed that every rigidly convex curve in the real plane bounds a spectrahedron. This leads to the computational problem of explicitly producing a symmetric (positive definite) linear determinantal representation for a…
We give two algorithms to compute linear determinantal representations of smooth plane curves of any degree over any field. As particular examples, we explicitly give representatives of all equivalence classes of linear determinantal…
In this paper we give a new and simple algorithm to put any multivariate polynomial into a normal determinant form in which each entry has the form , and in each column the same variable appears. We also apply the algorithm to obtain a…
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…
We introduce the DeterminantalRepresentations package for Macaulay2, which computes definite symmetric determinantal representations of real polynomials. We focus on quadrics and plane curves of low degree (i.e. cubics and quartics). Our…
Determinantal polynomials play a crucial role in semidefinite programming problems. Helton-Vinnikov proved that real zero (RZ) bivariate polynomials are determinantal. However, it leads to a challenging problem to compute such a…