The full-support eigenfunction conjecture for compact metric graphs

Let G\mathcal{G} be a compact, connected metric graph. The Laplacian on G\mathcal{G} has natural vertex conditions, and an eigenfunction is said to have full support if it does not vanish identically on any edge. For an eigenfunction ψn\psi_n, let {ψn0}|\{\psi_n\neq 0\}| denote the total length of the edges on which it is not identically zero, and let G|\mathcal{G}| be the total length of the graph.

Full-support eigenfunction conjecture. There exists a choice of eigenfunctions ψn\psi_n forming an orthonormal basis of L2(G)L^2(\mathcal{G}) and a subsequence (nk)N(n_k)\subset\mathbb{N} such that no ψnk\psi_{n_k} vanishes identically on any edge of G\mathcal{G}. Equivalently,

1acc{{ψn0}G:nN}.1\in\operatorname{acc}\left\{\frac{|\{\psi_n\neq 0\}|}{|\mathcal{G}|}:n\in\mathbb{N}\right\}.

The conjecture would imply that, for every compact connected metric graph, one can choose natural-Laplacian eigenfunctions with nodal-domain ratios having limit superior equal to 11.

Sources & referencesView supporting material

Primary source

Matthias Hofmann, James B. Kennedy, Delio Mugnolo and Marvin Plümer, “On Pleijel's nodal domain theorem for quantum graphs”, arXiv:2012.05808 (2020).

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.