Generic Laplacian eigenfunctions on metric graphs
From MaRDI portal
Publication:6566355
Cites work
- A lower bound for nodal count on discrete and metric graphs
- Anomalous nodal count and singularities in the dispersion relation of honeycomb graphs
- Can one hear the shape of a graph?
- Eigenfunction statistics on quantum graphs
- Eigenfunctions of Laplace operators
- Generic spectral simplicity of polygons
- Genericity of simple eigenvalues for a metric graph
- Geometric categories and o-minimal structures
- Hyperbolic triangles without embedded eigenvalues
- Introduction to quantum graphs
- Inverse spectral problem for quantum graphs
- Limits of quantum graph operators with shrinking edges
- Nodal counting on quantum graphs
- Nodal statistics on quantum graphs
- On Pleijel's nodal domain theorem for quantum graphs
- On fully supported eigenfunctions of quantum graphs
- On the level spacing distribution in quantum graphs.
- Projections of semi-analytic sets
- Quantum graphs which optimize the spectral gap
- Relationship between scattering matrix and spectrum of quantum graphs
- Semi-classical measures on quantum graphs and the Gauß map of the determinant manifold
- Semianalytic and subanalytic sets
- Simplicity of eigenvalues and non-vanishing of eigenfunctions of a quantum graph
- Stable polynomials and crystalline measures
- Toral algebraic sets and function theory on polydisks
This page was built for publication: Generic Laplacian eigenfunctions on metric graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566355)