On fully supported eigenfunctions of quantum graphs

DOI10.1007/S11005-021-01489-9MaRDI QIDQ2062630zbMATH OpenOpenAlexFDO

Authors M. Plümer, Matthias Täufer

Publication date 27 December 2021

Published in Letters in Mathematical Physics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2106.10096

zbMATH Keywords

quantum graphs

Mathematics Subject Classification ID

Boundary value problems on graphs and networks for ordinary differential equations (34B45) Eigenfunctions, eigenfunction expansions, completeness of eigenfunctions of ordinary differential operators (34L10) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)

Recommendations

• On Pleijel's nodal domain theorem for quantum graphs
• Nodal statistics on quantum graphs
• Nodal counting on quantum graphs
• The nodal count \(\{0,1,2,3,\ldots\}\) implies the graph is a tree
• A lower bound for nodal count on discrete and metric graphs

Cites work

• A lower bound for nodal count on discrete and metric graphs
• Extremal properties of eigenvalues for a metric graph.
• Genericity of simple eigenvalues for a metric graph
• Introduction to quantum graphs
• Nodal counting on quantum graphs
• Nodal domains on graphs - How to count them and why?
• Nodal statistics on quantum graphs
• On Pleijel's nodal domain theorem
• On Pleijel's nodal domain theorem for quantum graphs
• On the ground state for quantum graphs
• Oscillation properties of the spectrum of a boundary value problem on a graph
• Periodic orbit theory and spectral statistics for quantum graphs
• Remarks on courant's nodal line theorem
• Semi-classical measures on quantum graphs and the Gauß map of the determinant manifold
• Simplicity of eigenvalues and non-vanishing of eigenfunctions of a quantum graph
• The nodal count \(\{0,1,2,3,\ldots\}\) implies the graph is a tree
• The trace formula for quantum graphs with general self adjoint boundary conditions

Cited in

(10)

• Nodal statistics on quantum graphs
• Simplicity of eigenvalues and non-vanishing of eigenfunctions of a quantum graph
• Concrete method for recovering the Euler characteristic of quantum graphs
• Complete dynamical evaluation of the characteristic polynomial of binary quantum graphs
• Sturm-Liouville problems and global bounds by small control sets and applications to quantum graphs
• On fully supported eigenfunctions of quantum graphs
• Universality of Nodal Count Distribution in Large Metric Graphs
• Generic Laplacian eigenfunctions on metric graphs
• Spectral theory for Schrödinger operators on compact metric graphs with and ' couplings: a survey
• Schrödinger eigenfunctions sharing the same modulus and applications to the control of quantum systems

This page was built for publication: On fully supported eigenfunctions of quantum graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2062630)