2020
DOI: 10.1090/conm/741/14922
|View full text |Cite
|
Sign up to set email alerts
|

An index theorem for Schrödinger operators on metric graphs

Abstract: We show that the spectral flow of a one-parameter family of Schrödinger operators on a metric graph is equal to the Maslov index of a path of Lagrangian subspaces describing the vertex conditions. In addition, we derive an Hadamard-type formula for the derivatives of the eigenvalue curves via the Maslov crossing form.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 8 publications
(9 citation statements)
references
References 27 publications
(55 reference statements)
0
9
0
Order By: Relevance
“…In the generic picture, the various intersection terms in (11) disappear. The authors of [26] study the Morse index of Schrödinger operators on graphs. By reducing the problem to an interval, they provide a Morse index formula as the Maslov index of a curve in a Lagrangian Grassmanian of a sufficiently big dimension.…”
Section: Main Results and Structure Of The Papermentioning
confidence: 99%
“…In the generic picture, the various intersection terms in (11) disappear. The authors of [26] study the Morse index of Schrödinger operators on graphs. By reducing the problem to an interval, they provide a Morse index formula as the Maslov index of a curve in a Lagrangian Grassmanian of a sufficiently big dimension.…”
Section: Main Results and Structure Of The Papermentioning
confidence: 99%
“…In this section, we apply our framework to an operator on the half-line that arises through consideration of nonlinear Schrödinger equations on quantum graphs with n infinite edges extending from a single vertex (i.e., on star graphs). Our direct motivation for considering this example is the recent analysis of Kairzhan and Pelinovsky (see [12]), and we also note that Kostrykin and Schrader have shown how the symplectic framework fits well with such problems (see [13]) and that Latushkin and Sukhtaiev have recently developed this framework in the case of quantum graphs with edges of finite length (see [15]). Finally, we mention that our general approach to quantum graphs is adapted from the reference [1].…”
Section: Application To Quantum Graphsmentioning
confidence: 99%
“…where L D has the same differential representation as L and H 2 D ( ) differs from H 2 NK ( ) by the Dirichlet conditions at the boundary vertices in V B instead of the NK conditions. The technique resembles the surgery principle widely used in the spectral analysis of differential operators on graphs [7,20].…”
Section: Remarkmentioning
confidence: 99%