Skip to content

How the eigenvalue region of standardized Laplacians leaves the 2005 polygon

Pavel Chebotarev

math.COarXiv:2611.02249

Abstract

Let Λn be the set of all eigenvalues of n× n standardized Laplacian matrices, and let Sn⊂eqΛn be the polygon introduced in 2005, with upper vertices λ0=0,…,λn-1=1. It is now known that Λn=Sn, and that Λn is convex, if and only if n4. We study how Λn leaves Sn near an edge [λm,λm+1], 2(m+1)<n. First, we prove a switching law for matrices having a boundary point of Λn as a simple eigenvalue: an explicit switching function on the arcs, built from the left and right eigenvectors and the outward normal, forces maximal weight where positive and zero weight where negative; intermediate weights occur only where it vanishes. Second, we perturb the weights of the arcs k k+m+1 in the circulant digraph (arcs k k+s, 1 s m, plus these arcs with weight τ) that realizes the point λm+τ(λm+1-λm). At second order, the first Fourier harmonic of the perturbation moves the eigenvalue beyond the line of the edge if and only if τ<τ*m=(πm/n)/(2(π/n)(π(m+1)/n)). For even n and m, the point with τ=τ*m is the vertex of Sn/2 lying on this edge, and digraphs with these arcs only at even k give an explicit eigenvalue path that leaves Sn at λm and, in all computed cases, ends at this vertex. Third, we give a conjectural, numerically supported picture of ∂Λ5: beyond each edge of S5 not incident to 0 or 1, Λ5 forms a cap bounded by four algebraic arcs, which leaves the edge tangentially at its endpoint adjacent to 0 or 1 and rejoins it at τ*1=(3-5)/2; the rest of the edge lies on ∂Λ5. In computations for n8, a cap returns to its edge smoothly at τ*m, at a corner at τ*m, or at a corner beyond τ*m.

Create a lesson