Asymptotic shape optimization for Riesz means of the Dirichlet Laplacian over convex domains
Simon Larson

TL;DR
This paper investigates the asymptotic behavior of extremal convex domains that optimize Riesz means of the Dirichlet Laplacian spectrum, showing convergence to perimeter-minimizing shapes like regular polygons.
Contribution
It characterizes the limits of shape optimization problems for Riesz means of the Dirichlet Laplacian in convex domains as perimeter minimizers, with explicit results for polygons.
Findings
Sequences of extremal domains are bounded and have convergent subsequences.
Limit shapes are characterized as perimeter minimizers within the admissible family.
For polygons with a fixed number of faces, extremal domains converge to regular polygons.
Abstract
For , a convex and bounded domain, we study the spectrum of the Dirichlet Laplacian on . For and let denote any extremal set of the shape optimization problem where is an admissible family of convex domains in . If and is a positive sequence tending to infinity we prove that is a bounded sequence, and hence contains a convergent subsequence. Under an additional assumption on we characterize the possible limits of such subsequences as minimizers of the perimeter among domains in of unit measure. For instance if…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
