Finiteness and exponential growth of full graph -spectra
arXiv:2609.20291
Abstract
We prove that the full spectrum of the graph -Laplacian is finite for every finite graph and every real . This resolves the problem of finiteness of the full graph spectrum posed by Amghibech (2003). More generally, for signed weighted graph -Schrödinger operators with arbitrary real potentials, we obtain bounds in terms of the numbers of vertices and positive-weight edges, uniform in all coefficients and in . On vertices with positive-weight edges, the logarithms of the spectral cardinality and of the total number of connected components of the normalised eigenvector sets are ; the sum over the full spectrum of their rational Betti numbers is at most for an absolute constant . These topological bounds extend to homogeneous eigenproblems built from arbitrary finite families of linear forms, including generalised -eigenvalue problems for matrix pairs. For the uniformly weighted and , we identify the nonconstant eigenlines with the barycentres of the coordinate-hyperplane cell decomposition of and determine their local Morse data on either side of . A renormalised logarithmic limit describes the transition at . Positive integer weights then separate these critical values, giving at least distinct spectral values for every fixed and every . By contrast, the maximal spectral cardinality at is ; at , the maximal spectral cardinalities in the unsigned and general classes both have exponential growth rate exactly . For the same examples resolve Amghibech's extremal question. The proof combines o-minimal and Pfaffian geometry with projective -duality, Morse theory, critical groups, and tensor eigenvalue bounds.