Graph structure of the nodal set and bounds on the number of critical points of eigenfunctions on Riemannian manifolds
Matthias Hofmann, Matthias Täufer
TL;DR
This work reframes nodal sets of Laplace-type eigenfunctions on compact 2D manifolds as embedded metric graphs and derives Euler-characteristic–driven bounds on the number of nodal-graph vertices (critical points) and on the sum of vanishing orders. By combining Hartman–Wintner regularity with graph-theoretic Euler inequalities, the authors bound these nodal features in terms of the nodal count $μ(u)$ and the surface topology $χ(M)$, with sharper bounds when the nodal set is cellular. The results specialize to eigenfunctions, yielding bounds dependent on the eigenvalue index $k$ and Weyl-law scaling, and they are demonstrated to be sharp on spheres and tori via explicit examples. Extensions to planar domains with boundary and finite contour counts are discussed, along with constructions showing the necessity of finiteness for the bounds. Overall, the paper provides a global, topological perspective on the extremal behavior of eigenfunctions through nodal-graph theory.
Abstract
In this article, we illustrate and draw connections between the geometry of zero sets of eigenfunctions, graph theory and the vanishing order of eigenfunctions. We identify the nodal set of an eigenfunction of the Laplacian (with smooth potential) on a compact, two-dmensional Riemannian manifolds, that is on Riemannian surfaces, as an embedded metric graph and then use tools from elementary graph theory in order to estimate the number of critical points in the nodal set of the $k$-th eigenfunction and the sum of vanishing orders at critical points in terms of $k$ and the Euler-Poincaré characteristic of the surface.
