The Steklov spectrum of convex polygonal domains I: spectral finiteness
Abstract: We explore the Steklov eigenvalue problem on convex polygons, focusing mainly on the inverse Steklov problem. Our primary finding reveals that, for almost all convex polygonal domains, there exist at most finitely many non-congruent domains with the same Steklov spectrum. Moreover, we obtain explicit upper bounds for the maximum number of mutually Steklov isospectral non-congruent polygonal domains. Along the way, we obtain isoperimetric bounds for the Steklov eigenvalues of a convex polygon in terms of the minimal interior angle of the polygon.
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.