Polynomials with and without determinantal representations
From MaRDI portal
characterizationconvex setsdeterminantal representationsHyperbolic polynomialslinear matrix polynomialsreal zero polynomials
Multilinear algebra, tensor calculus (15A69) Hermitian, skew-Hermitian, and related matrices (15B57) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Determinants, permanents, traces, other special matrix functions (15A15) Quadratic and bilinear forms, inner products (15A63) Matrix pencils (15A22)
Abstract: The problem of writing real zero polynomials as determinants of linear matrix polynomials has recently attracted a lot of attention. Helton and Vinnikov have proved that any real zero polynomial in two variables has a determinantal representation. Br"and'en has shown that the result does not extend to arbitrary numbers of variables, disproving the generalized Lax conjecture. We prove that in fact almost no real zero polynomial admits a determinantal representation; there are dimensional differences between the two sets. So the generalized Lax conjecture fails badly. The result follows from a general upper bound on the size of linear matrix polynomials. We then provide a large class of surprisingly simple explicit real zero polynomials that do not have a determinantal representation, improving upon Br"and'en's mostly unconstructive result. We finally characterize polynomials of which some power has a determinantal representation, in terms of an algebra with involution having a finite dimensional representation. We use the characterization to prove that any quadratic real zero polynomial has a determinantal representation, after taking a high enough power. Taking powers is thereby really necessary in general. The representations emerge explicitly, and we characterize them up to unitary equivalence.
Recommendations
Cites work
- scientific article; zbMATH DE number 4029737 (Why is no real title available?)
- scientific article; zbMATH DE number 44927 (Why is no real title available?)
- scientific article; zbMATH DE number 3327413 (Why is no real title available?)
- A Note on Hyperbolic Polynomials.
- An algebra determined by a binary cubic form
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Linear matrix inequality representation of sets
- Linearizing of n-ic forms and generalized Clifford algebras
- Matrix pencils and a generalized Clifford algebra
- Noncommutative convexity arises from linear matrix inequalities
- Obstructions to determinantal representability
- On the crossing rule
- On two extremal matrix problems
- Some geometric results in semidefinite programming
- Spaces of symmetric matrices of bounded rank
- Symmetric determinantal representation of polynomials
- The Lax conjecture is true
- The matricial relaxation of a linear matrix inequality
Cited in
(35)- Testing hyperbolicity of real polynomials
- LMI representations of convex semialgebraic sets and determinantal representations of algebraic hypersurfaces: past, present, and future
- Determinantal representations and the Hermite matrix
- Minimal realizations and determinantal representations in the indefinite setting
- Density of rational points near/on compact manifolds with certain curvature conditions
- A short proof of the symmetric determinantal representation of polynomials
- Conic stability of polynomials and positive maps
- The linear representations of decision problems
- Determinantal representations of hyperbolic plane curves: an elementary approach
- Roots of bivariate polynomial systems via determinantal representations
- Correlation matrices, Clifford algebras, and completely positive semidefinite rank
- A complete characterization of determinantal quadratic polynomials
- Determinantal representations of stable polynomials
- Symmetric determinantal representations in characteristic 2
- Normal and triangular determinantal representations of multivariate polynomials
- A real representation of complex polynomial matrices in the framework of conjugate product
- Noncommutative polynomials describing convex sets
- Bianalytic free maps between spectrahedra and spectraballs
- Definite determinantal representations via orthostochastic matrices
- Hyperbolic polynomials and generalized Clifford algebras
- Bianalytic maps between free spectrahedra
- Stable Noncommutative Polynomials and Their Determinantal Representations
- Extreme points of matrix convex sets, free spectrahedra, and dilation theory
- Non-representable hyperbolic matroids
- Spectrahedrality of hyperbolicity cones of multivariate matching polynomials
- Indecomposable matrices defining plane cubics
- Free loci of matrix pencils and domains of noncommutative rational functions
- Minimal determinantal representations of bivariate polynomials
- The Chow form of a reciprocal linear space
- Stable and real-zero polynomials in two variables
- CERTAIN REPRESENTATION OF A REAL POLYNOMIAL
- Symmetric determinantal representation of polynomials
- Determinantal representations and the image of the principal minor map
- Norm-constrained determinantal representations of multivariable polynomials
- Hyperbolicity cones of elementary symmetric polynomials are spectrahedral
This page was built for publication: Polynomials with and without determinantal representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q445815)
