Abstract
Sign patterns are matrices with only the sign of each entry specified. The refined inertia of a matrix categorizes the eigenvalues as positive, negative, zero or nonzero imaginary, and the refined inertia of a sign pattern is the set of all refined inertias allowed by real matrices with that sign pattern. The complete sets of allowed refined inertias for all tree sign patterns of orders 2 and 3 (up to equivalence and negation) are determined.
Citation
D. Olesky. Michael Rempel. P. van den Driessche. "Refined inertias of tree sign patterns of orders 2 and 3." Involve 6 (1) 1 - 12, 2013. https://doi.org/10.2140/involve.2013.6.1
Information
