paper

Observable sets for Schrödinger equations on combinatorial graphs

arXiv:2511.10358

Abstract

We study observable sets for Schrödinger equations on combinatorial graphs. For one-dimensional lattice Schrödinger operators \(H=-Δ_{\mathrm{disc}}+V\) with \(V(n)\to c\in\mathbb R\) as \(|n|\to\infty\), we prove that a set \(E\subset\mathbb Z\) is observable at some time, equivalently at any time, if and only if it satisfies a local arithmetic condition. This reveals an arithmetic obstruction absent from the Euclidean theory, where thickness is the decisive condition. The same criterion also characterizes observability for the corresponding heat equation on \(\mathbb Z\). In higher-dimensional lattices, we prove observability from the complement of any finite set. We further obtain arithmetic criteria on discrete tori, showing that positive density alone does not ensure observability.

27 pages, 1 figure

Observable sets for Schrödinger equations on combinatorial graphs · wovepaper