Patterns that require distinct singular values

Abstract

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 characterization of the paths being the only graphs for which every real symmetric matrix with the given graph has no repeated eigenvalue.