Polynomials with and without determinantal representations
Publication:445815
DOI10.1016/j.laa.2012.04.043zbMath1259.15016arXiv1008.1931OpenAlexW2963622396WikidataQ61677676 ScholiaQ61677676MaRDI QIDQ445815
Publication date: 27 August 2012
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1008.1931
convex setscharacterizationdeterminantal representationsHyperbolic polynomialslinear matrix polynomialsreal zero polynomials
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Determinants, permanents, traces, other special matrix functions (15A15) Hermitian, skew-Hermitian, and related matrices (15B57) Quadratic and bilinear forms, inner products (15A63) Multilinear algebra, tensor calculus (15A69) Matrix pencils (15A22)
Related Items (27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Symmetric determinantal representation of polynomials
- Obstructions to determinantal representability
- Noncommutative convexity arises from linear matrix inequalities
- On two extremal matrix problems
- Spaces of symmetric matrices of bounded rank
- Matrix pencils and a generalized Clifford algebra
- Some geometric results in semidefinite programming
- The matricial relaxation of a linear matrix inequality
- An algebra determined by a binary cubic form
- Linear matrix inequality representation of sets
- Linearizing of n-ic forms and generalized Clifford algebras
- The Lax conjecture is true
- On the crossing rule
- A Note on Hyperbolic Polynomials.
- Handbook of semidefinite programming. Theory, algorithms, and applications
This page was built for publication: Polynomials with and without determinantal representations