The non-symmetric strong multiplicity property for sign patterns

Abstract

We develop a non-symmetric strong multiplicity property for matrices that may or may not be symmetric. We say a sign pattern allows the non-symmetric strong multiplicity property if there is a matrix with the non-symmetric strong multiplicity property that has the given sign pattern. We show that this property of a matrix pattern preserves multiplicities of eigenvalues for superpatterns of the pattern. We also provide a bifurcation lemma, showing that a matrix pattern with the property also allows refinements of the multiplicity list of eigenvalues. We conclude by demonstrating how this property can help with the inverse eigenvalue problem of determining the number of distinct eigenvalues allowed by a sign pattern