Quantum trees which maximize higher eigenvalues are unbalanced

DOI10.1090/BPROC/60zbMATH Open1487.05168arXiv2006.11815OpenAlexW3035961690MaRDI QIDQ5068127FDOQ5068127

Jonathan Rohleder

Publication date: 5 April 2022

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

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.

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

zbMATH Keywords

spectral estimatesisoperimetric problems for eigenvalues

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Numerical optimization of low eigenvalues of the Dirichlet and Neumann laplacians
• Extremal properties of eigenvalues for a metric graph.
• Spectral gap for quantum graphs and their edge connectivity
• On the ground state of quantum graphs with attractive \(\delta \)-coupling
• On the spectral gap of a quantum graph
• Title not available (Why is that?)
• Rayleigh estimates for differential operators on graphs
• Eigenvalue estimates for the Laplacian on a metric tree
• Title not available (Why is that?)
• Maximization of the second positive Neumann eigenvalue for planar domains
• On the sharpness of spectral estimates for graph Laplacians
• Spectral estimates for infinite quantum graphs
• Edge connectivity and the spectral gap of combinatorial and quantum graphs
• Quantum graphs which optimize the spectral gap
• Upper eigenvalue bounds for the Kirchhoff Laplacian on embedded metric graphs
• Schrödinger operators on graphs: symmetrization and Eulerian cycles
• Surgery principles for the spectral analysis of quantum graphs
• Maximization of the second non-trivial Neumann eigenvalue
• Laplacians on bipartite metric graphs
• Spectral Monotonicity for Schrödinger Operators on Metric Graphs
• Lower estimates on eigenvalues of quantum graphs
• A Family of Diameter-Based Eigenvalue Bounds for Quantum Graphs

Cited In (2)

• Spectral theory for Schrödinger operators on compact metric graphs with \(\delta\) and \(\delta '\) couplings: a survey
• Almost all trees have quantum symmetry

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)