Boundary Colin de Verdière conjecture for the first Steklov eigenvalue

Let MM be a compact surface with boundary, and let σ1(M)\sigma_1(M) denote its first nonzero Steklov eigenvalue. Define Chr(M,M)\mathrm{Chr}(M,\partial M) to be the number of vertices of the largest complete graph that can be embedded in MM with all vertices on M\partial M. Boundary Colin de Verdière conjecture. The maximal multiplicity of σ1(M)\sigma_1(M) is

Chr(M,M)1.\mathrm{Chr}(M,\partial M)-1.

This conjecture is a Steklov analogue of Colin de Verdière's conjecture for Schrödinger operators on surfaces, replacing the chromatic number by a boundary-embedded graph invariant. The supplied source does not report a resolution.

Sources & referencesView supporting material

Primary source

Pierre Jammes, “Prescription du spectre de Steklov dans une classe conforme”, arXiv:1209.4571 (2014).

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.