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

Abstract

For ⊂ Rn, a convex and bounded domain, we study the spectrum of - the Dirichlet Laplacian on . For ≥0 and γ ≥ 0 let , γ(A) denote any extremal set of the shape optimization problem \ Tr(--)-γ: ∈ A, ||=1\, where A is an admissible family of convex domains in Rn. If γ ≥ 1 and \j\j≥1 is a positive sequence tending to infinity we prove that \_j, γ(A)\j≥1 is a bounded sequence, and hence contains a convergent subsequence. Under an additional assumption on A we characterize the possible limits of such subsequences as minimizers of the perimeter among domains in A of unit measure. For instance if A is the set of all convex polygons with no more than m faces, then , γ converges, up to rotation and translation, to the regular m-gon. This is a revised version of the paper published in the Journal of Spectral Theory (2019) which has been updated in accordance with an erratum published in 2021. The results of the paper remain unchanged, but the proofs of Theorem 2.4 and Corollary 5.3 have been amended.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…