Periodic quantum graphs with predefined spectral gaps
Andrii Khrabustovskyi

TL;DR
This paper demonstrates how to engineer spectral gaps in periodic quantum graphs by choosing vertex conditions, allowing precise control over the spectrum's structure as the edge length parameter varies.
Contribution
It introduces a method to control and predict spectral gaps in quantum graphs through vertex condition adjustments, especially in the small parameter limit.
Findings
Spectral gaps can be made to appear at desired locations.
Asymptotic behavior of gaps is fully controllable via vertex conditions.
Exact placement of spectral gap edges can be achieved for small parameters.
Abstract
Let be an arbitrary -periodic metric graph, which does not coincide with a line. We consider the Hamiltonian on with the action on its edges; here is a small parameter. Let . We show that under a proper choice of vertex conditions the spectrum of has at least gaps as is small enough. We demonstrate that the asymptotic behavior of these gaps and the asymptotic behavior of the bottom of as can be completely controlled through a suitable choice of coupling constants standing in those vertex conditions. We also show how to ensure for fixed (small enough) the precise coincidence of the left endpoints of the first…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
