Maximizing the First Positive Neumann Eigenvalue of Simple Pentagons

A mix of human-written and AI-generated textHuman understanding: all partsmath.SP — Spectral Theory

Contributed by Lüwei Dong ↗, Hongyi Wang

Version 1 / Nov 19, 2026 / CC BY 4.0

Abstract

We prove that among all simple pentagons of prescribed area—including non-convex pentagons and pentagons with straight interior angles—the regular pentagon uniquely maximizes the first positive Neumann eigenvalue of the Laplacian up to congruence. The proof separates naturally into two regimes. For pentagons having at least one reflex or straight interior angle, the number of strictly convex vertices is at most four; conformal mapping from the unit disk together with a Schwarz–Christoffel and Blaschke-product estimate yields the uniform bound ∣P∣μ1(P)<10.34|P|\mu_1(P) < 10.34, strictly below the regular-pentagon value ∣R∣μ1(R)>10.35335|R|\mu_1(R) > 10.35335. For strictly convex pentagons, normalizing a maximum-area vertex triangle reduces the problem to a four-dimensional shape chart coupled with a unimodular metric matrix. Combining covariance bounds, explicit polynomial trial functions, conic duality for pairs of trial functions, and Bernstein-basis branch-and-bound, we confine every potential maximizer to an explicit neighborhood of the regular pentagon in vertex Fourier coordinates. Because the first positive eigenspace of the regular pentagon is two-dimensional, we analyze both eigenfunctions simultaneously together with their first-order corrections to show that every nontrivial local deformation of the similarity class strictly decreases ∣P∣μ1(P)|P|\mu_1(P). All finite-dimensional inequalities invoked in the proof are accompanied by independently verifiable rational and interval arithmetic certificates.

Author comments: 24 pages. The ancillary files include the numerical certificates and verification programs. Reproduction instructions for this submission are in anc/verification.json.

Provenance statement

Generative artificial intelligence tools were used during the derivation of arguments, the implementation of verification scripts, and the drafting and revision of the manuscript.

References

  1. R. S. Laugesen, Problem on polygonal Neumann eigenvalues, in Low Eigenvalues of Laplace and Schrödinger Operators , Oberwolfach Report 6/2009, p. 405. Workshop report.
  2. R. S. Laugesen and B. A. Siudeja, Maximizing Neumann fundamental tones of triangles, J. Math. Phys. 50 (2009), 112903. doi:10.1063/1.3246834 (https://doi.org/10.1063/1.3246834).DOI
  3. R. Endo and B. Osting, Maximizing the fundamental Laplace--Neumann eigenvalue on quadrilaterals, preprint (2026). arXiv:2609.02784 (https://arxiv.org/abs/2609.02784).arXiv
  4. H. Wang, The Pólya--Szegő inequalities for polygons, preprint (2026). arXiv:2611.22305 (https://arxiv.org/abs/2611.22305).arXiv
  5. L. E. Payne and H. F. Weinberger, An optimal Poincaré inequality for convex domains, Arch. Rational Mech. Anal. 5 (1960), 286--292. doi:10.1007/BF00252910 (https://doi.org/10.1007/BF00252910).DOI
  6. L. Dong and H. Wang, The first positive Neumann eigenvalue of simple pentagons and the large-side limit, Zenodo, version 1 (18 November 2026). doi:10.5281/zenodo.24356848 (https://doi.org/10.5281/zenodo.24356848).DOI

Version history

  1. v1 · 24 pagesSubmitted by Lüwei Dong24 pages. The ancillary files include the numerical certificates and verification programs. Reproduction instructions for this submission are in anc/verification.json.CurrentNov 19, 2026