Papers
Topics
Authors
Recent
Search
2000 character limit reached

A sharp two-disk bound for the second positive Neumann eigenvalue under a curvature upper bound

Published 22 Sep 2026 in math.AP, math.DG, and math.SP | (2609.26609v1)

Abstract: Langford and Laugesen conjectured a sharp two-disk bound for the third Neumann eigenvalue under an upper Gaussian-curvature bound (Math. Ann. 386 (2023), 2255--2281, Conjecture 1.4). We prove the conjectured bound for bounded Lipschitz membranes with the weight regularity used by Langford and Laugesen, and strengthen it to a sharp reciprocal inequality. Let Ω⊂CΩ\subset\mathbb{C} be a bounded simply connected Lipschitz domain, let ω∈C<sup>2(Ω)∩</sup>C(Ω‾)ω\in C<sup>2(Ω)\cap</sup> C(\overlineΩ) be positive on Ω‾\overlineΩ, and equip ΩΩ with g=ω∣dz∣<sup>2g=ω|dz|<sup>2. Suppose Kg≤KK_g\le K, $A=\int_Ωω\,dx&gt;0$, and $KA&lt;4π$ when $K&gt;0$. Enumerate the Neumann eigenvalues, counting multiplicity, by $0=λ_0&lt;λ_1\leλ_2\le\cdots$. If DK(A/2)D_K(A/2) is the constant-curvature geodesic disk of area A/2A/2, then $\frac{1}{λ_2(Ω,g)}+\frac{1}{λ_3(Ω,g)}&gt;\frac{2}{λ_1(D_K(A/2))}$ and $λ_2(Ω,g)&lt;λ_1(D_K(A/2))$. No simplicity of λ1λ_1 or boundary differentiability of ωω is required. The same conclusions hold for relatively compact disk-type Lipschitz domains in smooth Riemannian surfaces. Both bounds are sharp at fixed area and curvature upper bound: for each admissible K,AK,A, a sequence of smooth connected domains of area AA in the constant-curvature model has fixed-index Neumann spectra converging to those of DK(A/2)⊔DK(A/2)D_K(A/2)\sqcup D_K(A/2). Neither extremal value is attained in either connected class. The proof uses two-pole Green coordinates, a positive-kernel comparison, simultaneous centering of two complex moments, and a shifted reciprocal variational estimate.

Authors (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.