Quantum trees which maximize higher eigenvalues are unbalanced
From MaRDI portal
Publication:5068127
DOI10.1090/bproc/60zbMath1487.05168arXiv2006.11815OpenAlexW3035961690MaRDI QIDQ5068127
Publication date: 5 April 2022
Published in: Proceedings of the American Mathematical Society, Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.11815
Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Selfadjoint operator theory in quantum theory, including spectral analysis (81Q10) Boundary value problems on graphs and networks for ordinary differential equations (34B45) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the spectral gap of a quantum graph
- Rayleigh estimates for differential operators on graphs
- On the sharpness of spectral estimates for graph Laplacians
- Spectral estimates for infinite quantum graphs
- Quantum graphs which optimize the spectral gap
- Numerical optimization of low eigenvalues of the Dirichlet and Neumann laplacians
- Extremal properties of eigenvalues for a metric graph.
- On the ground state of quantum graphs with attractive \(\delta \)-coupling
- Maximization of the second non-trivial Neumann eigenvalue
- Upper eigenvalue bounds for the Kirchhoff Laplacian on embedded metric graphs
- Maximization of the second positive Neumann eigenvalue for planar domains
- Schrödinger operators on graphs: Symmetrization and Eulerian cycles
- Eigenvalue estimates for the Laplacian on a metric tree
- Laplacians on bipartite metric graphs
- Lower estimates on eigenvalues of quantum graphs
- A Family of Diameter-Based Eigenvalue Bounds for Quantum Graphs
- Spectral Monotonicity for Schrödinger Operators on Metric Graphs
- Surgery principles for the spectral analysis of quantum graphs
- Spectral gap for quantum graphs and their edge connectivity
- Edge connectivity and the spectral gap of combinatorial and quantum graphs
This page was built for publication: Quantum trees which maximize higher eigenvalues are unbalanced
