The Ranks of Extremal Positive Semidefinite Matrices with Given Sparsity Pattern
From MaRDI portal
Publication:3348009
Recommendations
Cited in
(19)- Extremal correlation matrices
- Positive semidefinite matrices with a given sparsity pattern
- One-step completions of Hermitian partial matrices with minimal negative signature
- Nonchordal positive semidefinite stochastic matrices∗
- Minimal separators of 2-chordal graphs
- Research problem: The completion number of a graph
- The positive definite completion problem revisited
- More on extremal positive semidefinite doubly stochastic matrices
- Extremal positive semidefinite doubly stochastic matrices
- Extremal rays and duals for cones of positive definite matrices with prescribed zeros
- Extremal bipartite matrices
- Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors
- Do sums of squares dream of free resolutions?
- Graphs with sparsity order at most two: the complex case
- Positive semidefinite rank and nested spectrahedra
- Extreme rays and faces for the cone of class functions non-negative on the set of Gram matrices
- Extermal positive semidefinite matrices with given sparsity pattern
- Hereditary properties of matrices with cut-points
- On the sparsity order of a graph and its deficiency in chordality
This page was built for publication: The Ranks of Extremal Positive Semidefinite Matrices with Given Sparsity Pattern
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3348009)