5 papers
A strong nullity parameter for rooted graphs
Aida Abiad, Mary Flagg, H. Tracy Hall +2
The inverse eigenvalue problem of a graph studies the possible spectra of matrices associated with , including as an important subproblem the possible nullities of such a ma…
Patterns that require distinct singular values
Caleb Cheung, Bryan Shader
Patterns of m by n matrices of term-rank m for which every real matrix with the pattern has no multiple singular value are characterized. This generalizes Fiedler's characterizatio…
The Strong Singular Value Property for Matrices
Caleb Cheung, Bryan Shader
A new property, the strong singular value property, is introduced, developed, and utilized to study the problem of which lists of nonnegative real numbers occur as the singular val…
Determinants of Seidel Tournament Matrices
Sarah Klanderman, MurphyKate Montee, Andrzej Piotrowski +2
The Seidel matrix of a tournament on players is an skew-symmetric matrix with entries in that encapsulates the outcomes of the games in the given tou…
The inverse nullity pair problem and the strong nullity interlacing property
Aida Abiad, Bryan A. Curtis, Mary Flagg +3
The inverse eigenvalue problem studies the possible spectra among matrices whose off-diagonal entries have their zero-nonzero patterns described by the adjacency of a graph . In…