A Structured Inverse Spectrum Problem for Infinite Graphs and Unbounded Operators
Ehssan Khanmohammadi

TL;DR
This paper proves that for any infinite graph and any closed, infinite set of real numbers, there exists an unbounded self-adjoint operator with the graph structure and spectrum matching these sets.
Contribution
It establishes the existence of unbounded self-adjoint operators with prescribed graph structures and spectra for infinite graphs, solving a structured inverse spectrum problem.
Findings
Existence of unbounded self-adjoint operators with given graph and spectrum
Construction method for operators on infinite graphs
Extension of inverse spectral theory to unbounded operators
Abstract
Given an infinite graph on countably many vertices, and a closed, infinite set of real numbers, we prove the existence of an unbounded self-adjoint operator whose graph is and whose spectrum is .
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.
