Answers are grounded in this paper and cite their sources.
This preprint presents a computer-assisted proof that the regular pentagon uniquely maximizes the first positive Neumann eigenvalue among simple pentagons of fixed area, up to congruence. It also gives bounds for polygons with at most four strictly convex vertices, compares the regular hexagon and heptagon with nonconvex competitors, and determines the leading asymptotic deficit from the disk as the number of sides tends to infinity. For sufficiently large numbers of sides, the paper gives a strict comparison between the regular polygon and every nonconvex polygon of the same area and number of sides.
No takes yet. Share an insight, caveat, or question.
Dong et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: