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
Related
- Inverse spectral results for the magnetic Schrödinger operator in low dimensions
- Inverse Resonance Problem for the Half-Line Schrödinger Operator with a Complex Robin Boundary Condition
- A Schiffer-type inverse obstacle problem for the planar Schrödinger equation with a single measurement
- Uniqueness for the inverse Schrödinger problem in the plane with Lp potentials, p>1
- An inverse scattering problem for the nonlinear Schrödinger equation under partial harmonic confinement
BibTeX
@misc{valeev2026optimization,
title = {{Optimization Inverse Spectral Problem for the Schrödinger Operator on a Compact Graph}},
author = {Nur Valeev},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.18081},
eprint = {2610.18081},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.18081},
}
RIS
TY - UNPB
TI - Optimization Inverse Spectral Problem for the Schrödinger Operator on a Compact Graph
AU - Nur Valeev
PY - 2026
DA - 2026/10/23
PB - arXiv
DO - 10.48550/arxiv.2610.18081
UR - https://arxiv.org/abs/2610.18081
AB - 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
ER -