The Sign Symmetric P_0,1⁺-Matrix Completion Problem

2024/05/29 by Victor Tomno, Tomno, Victor, Linety Muhati +1
Computer Science · Mathematics · #15A83 (Primary) #Advanced Topics in Algebra #Algebraic and Geometric Analysis #Combinatorics (math.CO) #FOS: Mathematics #Matrix Theory and Algorithms

paper · pdf · doi:10.48550/arxiv.2405.19268

openalex publication_date 2024/05/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We study sign symmetric P_0,1⁺-matrix completion problem. It is shown that any non-asymmetric incomplete digraph lacks sign symmetric P_0,1⁺-completion, digraphs of order at most four are completely classified and finally comparisons between sign symmetric P_0,1⁺-completion and other matrix completions was given.

Related

• On completions of symmetric and antisymmetric block diagonal partial matrices
• The CP-matrix completion problem
• The Signed Positive Semidefinite Matrix Completion Problem for Odd-K₄ Minor Free Signed Graphs
• Typical ranks in symmetric matrix completion
• Sign-restricted matrices of 0's, 1's, and -1's