Optimization Inverse Spectral Problem for the Schrödinger Operator on a Compact Graph

Abstract

We study the optimization inverse spectral problem (OISP) for the first $m$ eigenvalues of the Schrödinger operator on a compact metric graph. We prove the existence of a solution for every strictly increasing finite set of prescribed eigenvalues. On a graph without cycles, we obtain a representation of the optimal correction as a linear combination of squared eigenfunctions, provided that the selected eigenvalues are simple and separated from the next eigenvalue. On a graph with cycles, under the same simplicity and separation assumptions, we obtain a strong limiting representation of the optimal potential in terms of eigenfunctions of approximating operators. For a graph with a cycle, we give a counterexample with simple eigenvalues and linearly dependent squared eigenfunctions. We also prove that linear dependence of the squares of nonzero restrictions to an edge of eigenfunctions corresponding to distinct eigenvalues forces the potential on that edge to have an analytic representative