OpenAlex ·

The Pólya--Szegő conjecture for convex polygons with many sides

Zhuo Cheng, Changfeng Gui, Yeyao Hu and Qinfeng Li

Published
Source
OpenAlex
Published in
arXiv (Cornell University)
DOI
10.48550/arxiv.2609.18500
Original
Read it at the publisher
Topics
Mathematical PhysicsNumerical Analysis

Abstract

For every sufficiently large N, we prove that the regular N-gon uniquely minimizes the first Dirichlet eigenvalue among convex polygons of prescribed area with at most N sides, up to rigid motions. Quantitative Faber--Krahn stability localizes minimizers near the disk but leaves their discrete geometry undetermined. We encode that geometry by a centered measure of exterior angles and prove an inverse-cubic Fourier inequality whose equality case is the uniform root configuration. Its defect gives a lower bound for the quadratic spectral excess over the regular polygon. Cyclic cancellation and a common material-coordinate comparison make the nonlinear difference small relative to the same defect. Exact constraint coordinates extend this comparison to arbitrarily small positive defects. Minimality then forces zero defect, which characterizes the regular polygon.

The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.

Read it on ReadSearch

Each opens after you create an account, and brings you back to this paper.

Already a reader? Sign in

All new papers in Mathematical Physics

Get the few papers worth your time in Mathematical Physics every morning.

ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.

Papers belong to their authors and publishers; every page here links to the original. All research topics