加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本