\(N\)-matrix completion problem.
An \(n \times n\) matrix is called an \(N\)-matrix if all principal minors are negative. The authors prove that a combinatorially symmetric partial \(N\)-matrix has an \(N\)-matrix completion if the graph of its specified entries is a 1-chordal graph. They also prove that there exists an \(N\)-matrix completion for a partial \(N\)-matrix whose associated graph is an undirected cycle.
scientific article; zbMATH DE number 1993122