The P0-matrix completion problem

Date
2002-02-01
Authors
Choi, Ji Young
DeAlba, Luz
Hogben, Leslie
Hogben, Leslie
Maxwell, Mandi
Wangsness, Amy
Journal Title
Journal ISSN
Volume Title
Publisher
Source URI
Altmetrics
Authors
Research Projects
Organizational Units
Mathematics
Organizational Unit
Journal Issue
Series
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 ≥ 5 has P0-completion.

Description
<p>This article is published as Choi, Ji Young, Luz Maria DeAlba, Leslie Hogben, Mandi S. Maxwell, and Amy Wangsness. "The P<sub>0</sub>-matrix completion problem." <em>The Electronic Journal of Linear Algebra</em> 9 (2002): 1-20. DOI: <a href="https://doi.org/10.13001/1081-3810.1068" target="_blank">10.13001/1081-3810.1068</a>. Posted with permission.</p>
Keywords
Matrix completion, P0-matrix, P-matrix, digraph, n-cycle, asymmetric
Citation
Collections