Date Thesis Awarded
12-2019
Access Type
Honors Thesis -- Access Restricted On-Campus Only
Degree Name
Bachelors of Science (BS)
Department
Mathematics
Advisor
Charles Johnson
Committee Members
Timothy Davis
Christopher Vinroot
Abstract
A n-by-n matrix A is said to be eventually positive if there is a power k such that $A^k$ is entrywise positive, and all subsequent powers are also entrywise positive. Here we provide an expression for the smallest such exponent of a 2-by-2 eventually positive matrix in terms of its entries; we also show that if the graph of an eventually positive matrix is a tree, then the positive part of that matrix must be primitive.
Recommended Citation
Waugh, Madellyne, "Eventually Positive Matrices and Tree Sign Patterns" (2019). Undergraduate Honors Theses. William & Mary. Paper 1470.
https://scholarworks.wm.edu/honorstheses/1470
