The P_0-matrix completion problem
Ji Young Choi, Luz Maria DeAlba, Leslie Hogben, Mandi S. Maxwell, Amy Wangsness · Electronic Journal of Linear Algebra · 2002
Abstract. In this paper the P0-matrix completion problem is considered. It is established that every asymmetric partial P0-matrix has P0-completion. All 4 × 4 patterns that include all diagonal positions are classified as either having P0-completion or not having P0-completion. It is shown that any positionally symmetric pattern whose graph is an n-cycle with n ≥ 5hasP0-completion. Key words. Matrix completion, P0-matrix, P-matrix, digraph, n-cycle, asymmetric. AMS subject classifications. 15A48