WorksMathematics
The Sparse-Complement Conjecture for Two Distinct Eigenvalues
Abstract
For a graph , let be the minimum number of distinct eigenvalues of a real symmetric matrix whose off-diagonal zero–nonzero pattern is . We prove that whenever the complement of a graph of order has at most edges, resolving the sparse-complement conjecture of Fallat and Mojallal. If contains a cycle, the proof constructs a nontrivial orthogonal projector with the strong spectral property and rank at most , where is the union of the cyclic components of . The construction combines faithful stress-free Gram representations, a one-coordinate lift for each excess core edge, exact orthogonal-frame completion, and a Stiefel-manifold pendant-extension argument.