Counting Nodal Lines Which Touch the Boundary of an Analytic Domain

John A. Toth; Steve Zelditch

Home/Archive/arXiv

arXiv · 0710.0101

Counting Nodal Lines Which Touch the Boundary of an Analytic Domain

John A. Toth·Steve Zelditch

View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider the zeros on the boundary $\partial Ω$ of a Neumann eigenfunction $ϕ_λ$ of a real analytic plane domain $Ω$. We prove that the number of its boundary zeros is $O (λ)$ where $-Δϕ_λ = λ^2 ϕ_λ$. We also prove that the number of boundary critical points of either a Neumann or Dirichlet eigenfunction is $O(λ)$. It follows that the number of nodal lines of $ϕ_λ$ (components of the nodal set) which touch the boundary is of order $λ$. This upper bound is of the same order of magnitude as the length of the total nodal line, but is the square root of the Courant bound on the number of nodal components in the interior. More generally, the results are proved for piecewise analytic domains.

Explore related subjects

math.SP math.AP

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

John A. Toth, Steve Zelditch. 2007-11-05. Counting Nodal Lines Which Touch the Boundary of an Analytic Domain. https://arxiv.org/abs/0710.0101

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

KEEP EXPLORING

Related papers

arXiv2026

Arbitrarily Fast Quantum Dispersion in Long-Range Crystals

We construct the first examples of one-dimensional long-range crystals exhibiting arbitrarily fast polynomial dispersive bounds. The Floquet functions of our Hamiltonians are highly oscillatory Weierstrass functions, whose rough autosimilar structure drives the fast dispersion. The proof develops a new Fourier decay theory for $C^α$ images of the Lebesgue measure, based on a Dolgopyat-inspired transfer operator method, and yields a van der Corput lemma for Weierstrass functions. As a consequence, the local time of classical Weierstrass functions of sufficiently large lacunarity exists and is $C^k$, answering a question raised by Geman and Horowitz in 1980.

math.SP↗

arXiv2026

New graph invariants based on $p$-Laplacian eigenvalues

We present monotonicity inequalities for certain functions involving eigenvalues of $p$-Laplacians on signed graphs with respect to $p$. Inspired by such monotonicity, we propose new spectrum-based graph invariants, called (variational) cut-off adjacency eigenvalues, that are relevant to certain eigenvector-dependent nonlinear eigenvalue problem. Using these invariants, we obtain new lower bounds for the $p$-Laplacian variational eigenvalues, essentially giving the state-of-the-art spectral asymptotics for these eigenvalues. Moreover, based on such invariants, we establish two inertia bounds regarding the cardinalities of a maximum independent set and a minimum edge cover, respectively. The first inertia bound enhances the classical Cvetković bound, and the second one implies that the $k$-th $p$-Laplacian variational eigenvalue is of the order $2^p$ as $p$ tends to infinity whenever $k$ is larger than the cardinality of a minimum edge cover of the underlying graph. We further discover an interesting connection between graph $p$-Laplacian eigenvalues and tensor eigenvalues and discuss applications of our invariants to spectral problems of tensors.

math.SP↗

arXiv2026

Flexibility of eigenvalues for graph Laplacians arising from genus 3 surfaces

It is known that the small eigenvalues of the Laplacian of a Riemann surface close to the boundary of the modular space can be well approximated by the eigenvalues of the discrete Laplacian on a certain graph coming from the pair of pants decomposition of the surface. In this paper, we provide a complete description of the sets of eigenvalues of the weighted graph Laplacian for all graphs on four vertices that correspond to a valid pair of pants decomposition of a surface of genus 3.

math.SP↗