Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without K₅ minors

DOI10.1016/J.LAA.2016.07.026zbMATH Open1348.52010OpenAlexW2482722165MaRDI QIDQ314769FDOQ314769

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 polytopeelliptopeextremal matrixgraphs without \(K_5\) minorsseries-parallel graphsparsity order

Mathematics Subject Classification ID

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

Cites Work

• polymake: a framework for analyzing convex polytopes
• Regular and semi-regular polytopes. III
• Geometry of cuts and metrics
• On the cut polytope
• Title not available (Why is that?)
• Multivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry
• 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
• The Ranks of Extremal Positive Semidefinite Matrices with Given Sparsity Pattern
• Sparsity Patterns with High Rank Extremal Positive Semidefinite Matrices
• The real positive definite completion problem: cycle completability
• Generic Spectrahedral Shadows
• The real positive semidefinite completion problem for series-parallel graphs

Cited In (3)

• Extermal positive semidefinite matrices with given sparsity pattern
• Do Sums of Squares Dream of Free Resolutions?
• On the sparsity order of a graph and its deficiency in chordality

Uses Software

• polymake

   Recommendations

• Extermal positive semidefinite matrices with given sparsity pattern 👍 👎
• The Ranks of Extremal Positive Semidefinite Matrices with Given Sparsity Pattern 👍 👎
• On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph 👍 👎
• Positive semidefinite matrices with a given sparsity pattern 👍 👎
• Sparsity Patterns with High Rank Extremal Positive Semidefinite Matrices 👍 👎
• Title not available (Why is that?) 👍 👎
• Graphs whose positive semi-definite matrices have nullity at most two 👍 👎
• On the maximum positive semi-definite nullity and the cycle matroid of graphs 👍 👎
• Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors 👍 👎
• Characterizing graphs with fully positive semidefinite \(Q\)-matrices 👍 👎

This page was built for publication: Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q314769)