Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors

DOI10.1016/j.laa.2016.07.026zbMath1348.52010OpenAlexW2482722165MaRDI QIDQ314769

Liam Solus, Caroline Uhler, Ruriko Yoshida

Publication date: 16 September 2016

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2016.07.026

zbMATH Keywords

cut polytopeseries-parallel graphelliptopeextremal matrixgraphs without \(K_5\) minorssparsity order

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

Do Sums of Squares Dream of Free Resolutions?

Uses Software

• polymake

Cites Work

• Unnamed Item
• Unnamed Item
• The real positive semidefinite completion problem for series-parallel graphs
• Regular and semi-regular polytopes. III
• Positive semidefinite matrices with a given sparsity pattern
• The real positive definite completion problem for a simple cycle
• On the sparsity order of a graph and its deficiency in chordality
• Extremal bipartite matrices
• On a positive semidefinite relaxation of the cut polytope
• Some geometric results in semidefinite programming
• Multivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry
• The Ranks of Extremal Positive Semidefinite Matrices with Given Sparsity Pattern
• Sparsity Patterns with High Rank Extremal Positive Semidefinite Matrices
• On the cut polytope
• The real positive definite completion problem: cycle completability
• Generic Spectrahedral Shadows
• Geometry of cuts and metrics