On fully supported eigenfunctions of quantum graphs
arXiv:2106.10096 · doi:10.1007/s11005-021-01489-9
Abstract
We prove that every metric graph which is a tree has an orthonormal sequence of Laplace-eigenfunctions of full support. This implies that the number of nodal domains of the -th eigenfunction of the Laplacian with standard conditions satisfies along a subsequence and has previously only been known in special cases such as mutually rationally dependent or rationally independent side lengths. It shows in particular that the Pleijel nodal domain asymptotics from two- or higher dimensional domains cannot occur on these graphs: Despite their more complicated topology, they still behave as in the one-dimensional case. We prove an analogous result on general metric graphs under the condition that they have at least one Dirichlet vertex. Furthermore, we generalize our results to Delta vertex conditions and to edgewise constant potentials. The main technical contribution is a new expression for a secular function in which modifications to the graph, to vertex conditions, and to the potential are particularly easy to understand.
arXiv comment18 pages
References in corpus (8)
- Periodic Orbit Theory and Spectral Statistics for Quantum Graphs
- The trace formula for quantum graphs with general self adjoint boundary conditions
- Nodal domains on quantum graphs
- A lower bound for nodal count on discrete and metric graphs
- The Nodal Count {0, 1, 2, 3,...} Implies The Graph is a Tree
- Nodal Statistics On Quantum Graphs
- On Pleijel's nodal domain theorem for quantum graphs
- What is actually a metric graph?