Search arXiv⌕ Search

arXiv · 2611.02249

How the eigenvalue region of standardized Laplacians leaves the 2005 polygon

Abstract

Let $Λ_n$ be the set of all eigenvalues of $n\times n$ standardized Laplacian matrices, and let $S_n\subseteqΛ_n$ be the polygon introduced in 2005, with upper vertices $λ_0=0,\dots,λ_{n-1}=1$. It is now known that $Λ_n=S_n$, and that $Λ_n$ is convex, if and only if $n\le4$. We study how $Λ_n$ leaves $S_n$ 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\to k+m+1$ in the circulant digraph (arcs $k\to k+s$, $1\le s\le 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=\sin(πm/n)/(2\cos(π/n)\sin(π(m+1)/n))$. For even $n$ and $m$, the point with $τ=τ^*_m$ is the vertex of $S_{n/2}$ lying on this edge, and digraphs with these arcs only at even $k$ give an explicit eigenvalue path that leaves $S_n$ at $λ_m$ and, in all computed cases, ends at this vertex. Third, we give a conjectural, numerically supported picture of $\partialΛ_5$: beyond each edge of $S_5$ 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-\sqrt5)/2$; the rest of the edge lies on $\partialΛ_5$. In computations for $n\le8$, a cap returns to its edge smoothly at $τ^*_m$, at a corner at $τ^*_m$, or at a corner beyond $τ^*_m$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pavel Chebotarev. 2026-11-01. How the eigenvalue region of standardized Laplacians leaves the 2005 polygon. https://arxiv.org/abs/2611.02249

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Connected Dominating Sets in Triangulations

A dominating set of a graph $G$ is \emph{connected} if it induces a connected graph in $G$. For planar triangulations, it has been known since 1990 that every $n$-vertex triangulation with $n\ge4$ admits a connected dominating set of size at most $n/2 - 1$, and no improvement to this bound was known for over three decades. We break this longstanding barrier by showing that every $n$-vertex triangulation has a connected dominating set of size at most $10n/21$. Equivalently, every triangulation admits a spanning tree with at least $11n/21$ leaves. This result has graph drawing applications, establishing a bound for one-bend free sets and improving the known bound for simultaneous planar embeddings. The connected dominating set results extend readily to show that an $n$-vertex triangulation of a surface of Euler genus $g$ has a connected dominating set of size at most $10n/21+O(\sqrt{gn})$.

math.CO↗

Curves on the torus with few intersections

Aougab and Gaster [Math. Proc. Cambridge Philos. Soc. 174 (2023), 569-584] proved that any set of simple closed curves on the torus, where any two are non-homotopic and intersect at most k times, has a maximum size of $k+O(\sqrt{k}\log k)$. We determine the maximum size of such a set for every k. In particular, the maximum never exceeds k+6, and it does not exceed k+4 when k is large. As this quantity coincides with the maximal number of columns of a generic k-modular matrix with two rows, our result also settles the column number problem, a problem of interest in combinatorial optimization, for such matrices.

math.CO↗

Spectral extrema on closed surfaces of fixed Euler genus

We investigate a classical extremal problem in combinatorics and topological graph theory: determining the maximum spectral radius $spex(n,γ)$ of all $n$-vertex graphs embeddable on a closed surface of Euler genus $γ$. Building on seminal contributions by Boots and Royle, Cao and Vince, and Hong in the 1990s; Ellingham and Zha in 2000; Dvořák and Mohar in 2010; Tait and Tobin in 2017; and Liu, Ning, and Wang in 2026, we provide a complete characterization of spectral extremal graphs for any fixed Euler genus $γ$ and all sufficiently large $n$. The extremal graph attaining $\operatorname{spex}(n,γ)$ is unique, necessarily edge-extremal, and, roughly speaking, is constructed from the join $K_2 \nabla P_{n-2}$ by adding exactly $3γ$ edges. As a consequence, we derive asymptotically tight estimates for $\operatorname{spex}(n,γ)$, strengthening a classical bound due to Ellingham and Zha [J. Combin. Theory B, 2000]. We further characterize the extremal structures for the projective plane and torus, sharpening earlier bounds of Hong [J. Combin. Theory B, 1995]. For the planar case, we establish an explicit vertex threshold of $4.5\times 10^6$ for the Tait--Tobin theorem. Our approach combines extremal constructions of cellular embeddings, topological edge-switching techniques, and walk-counting estimates for large-scale substructures, revealing a bridge between spectral extremality and surface topology.

math.CO↗