The P0-matrix completion problem
Date
2002-02-01
Authors
Major Professor
Advisor
Committee Member
Journal Title
Journal ISSN
Volume Title
Publisher
Authors
Person
Hogben, Leslie
Associate Dean
Research Projects
Organizational Units
Organizational Unit
Mathematics
Welcome to the exciting world of mathematics at Iowa State University.
From cracking codes to modeling the spread of diseases, our program offers something for everyone. With a wide range of courses and research opportunities, you will have the chance to delve deep into the world of mathematics and discover your own unique talents and interests. Whether you dream of working for a top tech company, teaching at a prestigious university, or pursuing cutting-edge research, join us and discover the limitless potential of mathematics at Iowa State University!
Journal Issue
Is Version Of
Versions
Series
Department
Mathematics
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.
Comments
This article is published as Choi, Ji Young, Luz Maria DeAlba, Leslie Hogben, Mandi S. Maxwell, and Amy Wangsness. "The P0-matrix completion problem." The Electronic Journal of Linear Algebra 9 (2002): 1-20. DOI: 10.13001/1081-3810.1068. Posted with permission.
Description
Keywords
Citation
DOI
Subject Categories
Copyright
Tue Jan 01 00:00:00 UTC 2002