arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2012.05808math.SPmath-phmath.MP
收藏

On Pleijel's nodal domain theorem for quantum graphs

Matthias Hofmann, James B. Kennedy, Delio Mugnolo, Marvin Plümer

英文摘要:

We establish metric graph counterparts of Pleijel's theorem on the asymptotics of the number of nodal domains $ν_n$ of the $n$-th eigenfunction(s) of a broad class of operators on compact metric graphs, including Schrödinger operators with $L^1$-potentials and a variety of vertex conditions as well as the $p$-Laplacian with natural vertex conditions, and without any assumptions on the lengths of the edges, the topology of the graph, or the behaviour of the eigenfunctions at the vertices. {Among other things, these results characterise the accumulation points of the sequence $(\frac{ν_n}{n})_{n\in\mathbb N}$, which are shown always to form a finite subset of $(0,1]$. This} extends the previously known result that $ν_n\sim n$ \textit{generically}, for certain realisations of the Laplacian, in several directions. In particular, in the special cases of the Laplacian with natural conditions, we show that for graphs with rationally dependent edge lengths, one can find eigenfunctions thereon for which ${ν_n}\not\sim {n}$; but in this case even the set of points of accumulation may depend on the choice of eigenbasis.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑