The totally positive completion problem (Q703637)

A partial matrix over \(\mathbb{R}\) is a square matrix in which some entries are specified while the remaining ones are free to be chosen from \(\mathbb{R}\), with the additional property that all diagonal entries are prescribed. A completion of a partial matrix is the matrix resulting from a particular choice for the unspecified entries. A matrix completion problem asks the question: does a partial matrix with a certain property have a completion with the same property? Here the authors address the following property: a real square matrix is totally positive if every minor is nonnegative, and a partial matrix is totally positive if every completely specified submatrix is totally positive. As the answer in this case is generally negative, the authors analyze the question: for which labelled graphs \(G\) does every \(n\times n\) totally positive partial matrix whose associated graph (\(n\) vertices and edges corresponding to the specified off-diagonal elements) is \(G\), have a totally positive completion? The authors consider partial matrices whose \((i,j)\)-entry is specified if and only if its \((j,i)\)-entry is, which thus have undirected \(G\). When \(G\) is a path or a cycle, they give necessary and sufficient conditions for a positive answer.