| Popis: |
Given a graph Laplacian with positively and negatively weighted edges we are interested in characterizing the set of weights that give a particular spectral index, i.e.~give a prescribed number of positive, zero, and negative eigenvalues. One of the main results of this paper is that the set of signed Laplacians that exhibit multiple zero eigenvalues is "small", and that eigenvalue crossings are nongeneric --- specifically, eigenvalues repel each other near zero in a sense that can be made precise. We exhibit an algebraic discriminant that measures the level of repulsion, and show that this discriminant admits a combinatorial interpretation. Conversely, we exhibit a constructive method for finding the sets of Laplacians that exhibit a large degree of degeneracy (many eigenvalues at or near zero) in terms of these discriminants. |
