Generic Laplacian eigenfunctions on metric graphs
From MaRDI portal
Publication:6566355
DOI10.1007/s11854-023-0308-xMaRDI QIDQ6566355
Publication date: 3 July 2024
Published in: Journal d'Analyse Mathématique (Search for Journal in Brave)
Graph theory (05Cxx) Partial differential equations on manifolds; differential operators (58Jxx) General mathematical topics and methods in quantum theory (81Qxx)
Cites Work
- Unnamed Item
- Simplicity of eigenvalues and non-vanishing of eigenfunctions of a quantum graph
- Eigenfunction statistics on quantum graphs
- A lower bound for nodal count on discrete and metric graphs
- Semianalytic and subanalytic sets
- Nodal statistics on quantum graphs
- Quantum graphs which optimize the spectral gap
- Hyperbolic triangles without embedded eigenvalues
- Genericity of simple eigenvalues for a metric graph
- Geometric categories and o-minimal structures
- On Pleijel's nodal domain theorem for quantum graphs
- On fully supported eigenfunctions of quantum graphs
- Semi-classical measures on quantum graphs and the Gauß map of the determinant manifold
- Limits of quantum graph operators with shrinking edges
- Toral algebraic sets and function theory on polydisks
- Projections of semi-analytic sets
- Can one hear the shape of a graph?
- Relationship between scattering matrix and spectrum of quantum graphs
- Anomalous nodal count and singularities in the dispersion relation of honeycomb graphs
- Generic spectral simplicity of polygons
- Stable polynomials and crystalline measures
- Eigenfunctions of Laplace operators
- Nodal counting on quantum graphs
- Inverse spectral problem for quantum graphs
- On the level spacing distribution in quantum graphs.
This page was built for publication: Generic Laplacian eigenfunctions on metric graphs
