Quantum trees which maximize higher eigenvalues are unbalanced

DOI10.1090/BPROC/60MaRDI QIDQ5068127zbMATH OpenOpenAlexFDO

Authors Jonathan Rohleder

Publication date 5 April 2022

Published in Proceedings of the American Mathematical Society, Series B (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

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

zbMATH Keywords

isoperimetric problems for eigenvaluesspectral estimates

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Boundary value problems on graphs and networks for ordinary differential equations (34B45) Selfadjoint operator theory in quantum theory, including spectral analysis (81Q10) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)

Abstract: The isoperimetric problem of maximizing all eigenvalues of the Laplacian on a metric tree graph within the class of trees of a given average edge length is studied. It turns out that, up to rescaling, the unique maximizer of the $k$-th positive eigenvalue is the star graph with three edges of lengths $2k-1$, $1$ and $1$. This complements the previously known result that the first nonzero eigenvalue is maximized by all equilateral star graphs and indicates that optimizers of isoperimetric problems for higher eigenvalues may be less balanced in their shape -- an observation which is known from numerical results on the optimization of higher eigenvalues of Laplacians on Euclidean domains.

Recommendations

• Eigenvalue estimates for the Laplacian on a metric tree
• On multiplicity of eigenvalues in quantum graph theory
• Quantum graphs which optimize the spectral gap
• Eigenvalue and nodal properties on quantum graph trees
• On extremal eigenvalues of the graph Laplacian ^*

Cites work

• A Family of Diameter-Based Eigenvalue Bounds for Quantum Graphs
• Edge connectivity and the spectral gap of combinatorial and quantum graphs
• Eigenvalue estimates for the Laplacian on a metric tree
• Extremal properties of eigenvalues for a metric graph.
• scientific article; zbMATH DE number 4050157 (Why is no real title available?)
• scientific article; zbMATH DE number 5044570 (Why is no real title available?)
• scientific article; zbMATH DE number 3087123 (Why is no real title available?)
• scientific article; zbMATH DE number 3102668 (Why is no real title available?)
• Laplacians on bipartite metric graphs
• Lower estimates on eigenvalues of quantum graphs
• Maximization of the second non-trivial Neumann eigenvalue
• Maximization of the second positive Neumann eigenvalue for planar domains
• Numerical optimization of low eigenvalues of the Dirichlet and Neumann laplacians
• On the ground state of quantum graphs with attractive -coupling
• On the sharpness of spectral estimates for graph Laplacians
• On the spectral gap of a quantum graph
• Quantum graphs which optimize the spectral gap
• Rayleigh estimates for differential operators on graphs
• Schrödinger operators on graphs: symmetrization and Eulerian cycles
• Spectral estimates for infinite quantum graphs
• Spectral gap for quantum graphs and their edge connectivity
• Spectral monotonicity for Schrödinger operators on metric graphs
• Surgery principles for the spectral analysis of quantum graphs
• Upper eigenvalue bounds for the Kirchhoff Laplacian on embedded metric graphs

Cited in

(3)

• Almost all trees have quantum symmetry
• Spectral theory for Schrödinger operators on compact metric graphs with and ' couplings: a survey
• Optimization of quantum graph eigenvalues with preferred orientation vertex conditions

This page was built for publication: Quantum trees which maximize higher eigenvalues are unbalanced

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