Conjecture on Steklov spectral determination of convex polygonal domains

From papers

Let PP be a convex polygonal domain, and let Ω\Omega be a simply-connected smoothly bounded domain. Two domains are Steklov isospectral if their Steklov spectra, counted with multiplicities, coincide. Steklov spectral determination conjecture. A convex polygonal domain cannot be Steklov isospectral to a simply-connected smoothly bounded domain. This conjecture concerns whether the Steklov spectrum can distinguish convex polygonal domains from simply-connected smoothly bounded domains; the source presents it as a conjecture based on the evidence developed in the section, with its general resolution left open.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Emily B. Dryden, Carolyn Gordon, Javier Moreno, Julie Rowlett and Carlos Villegas-Blas, “The Steklov spectrum of convex polygonal domains II: investigating spectral determination”, arXiv:2604.18977 (2026).

Solutions 0

No solutions have been posted yet.