2000 character limit reached
Sharp bounds for the first two eigenvalues of an exterior Steklov eigenvalue problem (2304.11297v1)
Published 22 Apr 2023 in math.AP, math.DG, and math.SP
Abstract: Let $U\subset \mathbb{R}n$ ($n\geq 3$) be an exterior Euclidean domain with smooth boundary $\partial U$. We consider the Steklov eigenvalue problem on $U$. First we derive a sharp lower bound for the first eigenvalue in terms of the support function and the distance function to the origin of $\partial U$. Second under various geometric conditions on $\partial U$ we obtain sharp upper bounds for the first eigenvalue. Along the proof, we get a sharp upper bound for the capacity of $\partial U$ when $n=3$ and $\partial U$ is connected. Last we also discuss an upper bound for the second eigenvalue.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.