Date Thesis Awarded

4-2017

Document Type

Honors Thesis

Degree Name

Bachelors of Science (BS)

Department

Mathematics

Advisor

Charles R. Johnson

Committee Member

Donald E. Campbell

Committee Member

Gexin Yu

Abstract

A matrix is called totally nonnegative (TN) if the determinant of every square submatrix is nonnegative and totally positive (TP) if the determinant of every square submatrix is positive. The TP (TN) completion problem asks which partial matrices have a TP (TN) completion. In this paper, a new class of TP- and TN- completable patterns, the border patterns, is identified. This answers an unpublished question about TP-completable patterns that has been outstanding for some time and is the first case of completable patterns with all entries on the border specified. In the process, a new tool is developed: TP line insertion in the second or penultimate line when the first and last entries of the line are specified. Prior results about single unspecified entries are used and generalized.

Available for download on Thursday, May 10, 2018

Included in

Mathematics Commons

Share

COinS