Department/School

Mathematics

Date

1-1-2014

Document Type

Article

Keywords

totally nonnegative matrices, totally positive matrices, partial matrix, matrix completion problem, cycles

DOI

https://doi.org/10.13001/1081-3810.1429

Abstract

In earlier work, the labelled graphs G for which every combinatorially symmetric totally nonnegative matrix, the graph of whose specified entries is G, has a totally nonnegative completion were identified. For other graphs, additional conditions on the specified data must hold. Here, necessary and sufficient conditions on the specified data, when G is a cycle, are given for both the totally nonnegative and the totally positive completion problems.

Published in

Electronic Journal of Linear Algebra

Citation/Other Information

Johnson, C. R., & Kroschel, B. K. (2014). Conditions for a totally positive completion in the case of a symmetrically placed cycle. Electronic Journal of Linear Algebra, 22(1). https://doi.org/10.13001/1081-3810.1429

Included in

Mathematics Commons

Share

COinS